An Efficient Algorithm for Minimum-Weight Bibranching.
Judith KeijsperRudi PendavinghPublished in: J. Comb. Theory, Ser. B (1998)
Keyphrases
- minimum weight
- dynamic programming
- computational complexity
- search space
- learning algorithm
- randomized algorithm
- special case
- objective function
- worst case
- segmentation method
- spanning tree
- graph structure
- random walk
- greedy heuristic
- minimum spanning tree
- tree structure
- segmentation algorithm
- np hard
- optimal solution
- multiscale