论文信息 - Tree polytope on 2-trees - 字舞流文

Tree polytope on 2-trees

We give a complete polyhedral characterization of the tree polytope (convex hull of the characteristic vectors of trees in the graph) on 2-trees.

Thomas M. Liebling | François Margot | Alain Prodon | T. Liebling | F. Margot | A. Prodon

[1] Pawel Winter,et al. Generalized steiner problem in outerplanar networks , 1985, BIT.

[2] A. Prodon. Steiner trees with n terminals among n + 1 nodes , 1992, Oper. Res. Lett..

[3] Marshall W. Bern,et al. Faster exact algorithms for steiner trees in planar networks , 1990, Networks.

[4] Kurt Mehlhorn,et al. A Faster Approximation Algorithm for the Steiner Problem in Graphs , 1988, Inf. Process. Lett..

[5] Richard T. Wong,et al. A dual ascent approach for steiner tree problems on a directed graph , 1984, Math. Program..

[6] S. E. Dreyfus,et al. The steiner problem in graphs , 1971, Networks.

[7] Yash P. Aneja,et al. An integer linear programming approach to the steiner problem in graphs , 1980, Networks.

[8] Charles J. Colbourn,et al. Steiner trees, partial 2-trees, and minimum IFI networks , 1983, Networks.