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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Chopra and M.R. Rao, “On the multiway cut polyhedron,”Networks 21 (1991) 51–89.
W.H. Cunningham, “The optimal multiterminal cut problem,”DIMACS Series in Discrete Math. 5 (1991) 105–120.
E. Dahlhaus, D.S. Johnson, C.H. Papadimitriou, P. Seymour and M. Yannakakis, “The complexity of multiway cuts,” extended abstract (1983).
P.L. Erdős and L.A. Székely, “Evolutionary trees: an integer multicommodity max—flow-min—cut theorem,”Advances in Applied Mathematics 13 (1992) 375–389.
P.L. Erdős and L.A. Székely, “Algorithms and min—max theorems for certain multiway cut,” in: E. Balas, G. Cornuéjols and R. Kannan, eds.,Integer Programming and Combinatorial Optimization, Proceedings of the Conference held at Carnegie Mellon University, May 25–27, 1992, by the Mathematical Programming Society (CMU Press, Pittsburgh, 1992) 334–345.
W.M. Fitch, “Towards defining the course of evolution. Minimum change for specific tree topology,”Systematic Zoology 20 (1971) 406–416.
J.A. Hartigan, “Minimum mutation fits to a given tree,”Biometrics 29 (1973) 53–65.
L. Lovász and M.D. Plummer,Matching Theory (North-Holland, Amsterdam, 1986).
K. Menger, “Zur allgemeinen Kurventheorie,”Fundamenta Mathematicae 10 (1926)96–115
G.L. Nemhauser and L.A. Wolsey,Integer and Combinatorial Optimization (John Wiley & Sons, New York, 1988).
M. Steel, “Decompositions of leaf-coloured binary trees,”Advances in Applied Mathematics 14 (1993) 1–24.
P.L. Williams and W.M. Fitch, “Finding the minimal change in a given tree,” in: A. Dress and A. v. Haeseler, eds.,Trees and Hierarchical Structures, Lecture Notes in Biomathematics 84 (1989) 75–91.
D. Sankoff and R.J. Cedergren, “Simultaneous comparison of three or more sequences related by a tree,” in: D. Sankoff and J.B. Kruskal, eds.,Time Wraps, String Edits and Macromoleculas: The Theory and Practice of Sequence Comparison (Addison-Wesley, London, 1983) 253–263.
Author information
Authors and Affiliations
Additional information
Corresponding author.
Research of the author was supported by the A. v. Humboldt-Stiftung and the U.S. Office of Naval Research under the contract N-0014-91-J-1385.
Rights and permissions
About this article
Cite this article
Erdős, P.L., Székely, L.A. On weighted multiway cuts in trees. Mathematical Programming 65, 93–105 (1994). https://doi.org/10.1007/BF01581691
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01581691