On the dominant of the Steiner 2-edge connected subgraph polytope

DOI10.1016/S0166-218X(00)00306-1zbMath0979.05064MaRDI QIDQ5946813

Mourad Baïou

Publication date: 17 February 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

polytopedominantperfectly Steiner 2-edge connected graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35)

Related Items (1)

On survivable network polyhedra

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum-weight two-connected spanning networks
• Generalized Steiner problem in outerplanar networks
• Design of survivable networks
• Two-edge connected spanning subgraphs and polyhedra
• On perfectly two-edge connected graphs
• On two-connected subgraph polytopes
• The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs
• Topology of series-parallel networks
• \(k\)-edge connected polyhedra on series-parallel graphs
• The traveling salesman problem on a graph and some related integer polyhedra
• Generalized steiner problem in series-parallel networks
• Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
• Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
• The k-Edge-Connected Spanning Subgraph Polyhedron
• Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs

This page was built for publication: On the dominant of the Steiner 2-edge connected subgraph polytope