Abstract
We give a complete polyhedral characterization of the tree polytope (convex hull of the characteristic vectors of trees in the graph) on 2-trees.
Similar content being viewed by others
References
Y.P. Aneja, “An integer linear programming approach to the Steiner problem in graphs,”Networks 10 (1980) 167–178.
M.O. Ball, W.-G. Liu and W.R. Pulleyblank, “Two terminal Steiner tree polyhedra,” Research Report CORR 87-33, University of Waterloo (Waterloo, Ont., 1987).
M.W. Bern, “Faster exact algorithms for Steiner tree in planar networks,”Networks 20 (1990) 109–120.
R.B. Borie, R.G. Parker and C.A. Tovey, “Automatic generation of linear time algorithms from predicate calculus descriptions of problems on recursively constructed graph families,”Algorithmica 7 (1992) 555–582.
S.E. Dreyfus and R.A. Wagner, “The Steiner problem in graphs,”Networks 1 (1972) 195–207.
E.L. Lawler,Combinatorial Optimization: Networks and Matroids (Holt, Rinehart and Winston, New York, 1976).
F. Margot, A. Prodon and Th.M. Liebling, “Tree polyhedron on 2-tree and (n − 2,n) Steiner polyhedron,” Technical Report RO 910222, Département de Mathématiques, EPF Lausanne (Lausanne, 1991).
K. Mehlhorn, “A faster approximation algorithm for the Steiner problem in graphs,”Information Processing Letters 27 (1988) 125–128.
A. Prodon, “Steiner trees withn terminals amongn + 1 nodes,”Operations Research Letters 11 (1992) 125–133.
A. Prodon, Th.M. Liebling and H. Gröfflin, “Steiner's problem on two-trees,” Technical Report RO 850315, Départment de Mathématiques, EPF Lausanne (Lausanne, 1985).
D. Richards, “Fast heuristic algorithms for rectilinear Steiner trees,”Algorithmica 4 (1989) 191–207.
J.A. Wald and C.J. Colbourn, “Steiner trees, partial 2-trees and minimum IFI networks,”Networks 13 (1983) 159–167.
T.V. Wiemer, S.T. Hedetniemi and R. Laskar, “A methodology for constructing linear graph algorithms,”Congressus Numerantium 50 (1985) 43–60.
P. Winter, “Generalized Steiner problem in Halin networks,”Proceedings of the 12th International Symposium on Mathematical Programming (MIT, Cambridge, MA, 1985).
R.T. Wong, “A dual ascent approach for Steiner tree problems on a directed graph,”Mathematical Programming 28 (1984) 271–287.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Margot, F., Prodon, A. & Liebling, T.M. Tree polytope on 2-trees. Mathematical Programming 63, 183–191 (1994). https://doi.org/10.1007/BF01582065
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01582065