ISSN:
1436-4646
Keywords:
05C05
;
05C70
;
90C27
;
Multiway cut
;
Menger's theorem
;
Tree
;
Duality in linear programming
;
Dynamic programming
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract A min—max theorem is developed for the multiway cut problem of edge-weighted trees. We present a polynomial time algorithm to construct an optimal dual solution, if edge weights come in unary representation. Applications to biology also require some more complex edge weights. We describe a dynamic programming type algorithm for this more general problem from biology and show that our min—max theorem does not apply to it.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01581691
Permalink