Skip to main content
Log in

Tree polytope on 2-trees

  • Published:
Mathematical Programming Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Y.P. Aneja, “An integer linear programming approach to the Steiner problem in graphs,”Networks 10 (1980) 167–178.

    Google Scholar 

  2. 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).

    Google Scholar 

  3. M.W. Bern, “Faster exact algorithms for Steiner tree in planar networks,”Networks 20 (1990) 109–120.

    Google Scholar 

  4. 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.

    Google Scholar 

  5. S.E. Dreyfus and R.A. Wagner, “The Steiner problem in graphs,”Networks 1 (1972) 195–207.

    Google Scholar 

  6. E.L. Lawler,Combinatorial Optimization: Networks and Matroids (Holt, Rinehart and Winston, New York, 1976).

    Google Scholar 

  7. 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).

    Google Scholar 

  8. K. Mehlhorn, “A faster approximation algorithm for the Steiner problem in graphs,”Information Processing Letters 27 (1988) 125–128.

    Google Scholar 

  9. A. Prodon, “Steiner trees withn terminals amongn + 1 nodes,”Operations Research Letters 11 (1992) 125–133.

    Google Scholar 

  10. 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).

    Google Scholar 

  11. D. Richards, “Fast heuristic algorithms for rectilinear Steiner trees,”Algorithmica 4 (1989) 191–207.

    Google Scholar 

  12. J.A. Wald and C.J. Colbourn, “Steiner trees, partial 2-trees and minimum IFI networks,”Networks 13 (1983) 159–167.

    Google Scholar 

  13. T.V. Wiemer, S.T. Hedetniemi and R. Laskar, “A methodology for constructing linear graph algorithms,”Congressus Numerantium 50 (1985) 43–60.

    Google Scholar 

  14. P. Winter, “Generalized Steiner problem in Halin networks,”Proceedings of the 12th International Symposium on Mathematical Programming (MIT, Cambridge, MA, 1985).

    Google Scholar 

  15. R.T. Wong, “A dual ascent approach for Steiner tree problems on a directed graph,”Mathematical Programming 28 (1984) 271–287.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01582065

Key words

Navigation