✦ LIBER ✦

On Steiner 2-edge connected polytopes

✍ Scribed by A.R. Mahjoub; P. Pesneau

Book ID: 108498131
Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 287 KB
Volume: 5
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(05)80166-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On minimally k-edge-connected graphs and

On minimally k-edge-connected graphs and shortest k-edge-connected Steiner networks

✍ Tibor Jordán 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 170 KB

A graph G = (V; E) is called minimally (k; T )-edge-connected with respect to some T ⊆ V if there exist k-edge-disjoint paths between every pair u; v ∈ T but this property fails by deleting any edge of G. We show that |V | can be bounded by a (linear) function of k and |T | if each vertex in V -T ha

Steiner k-Edge Connected Subgraph Polyhe

Steiner k-Edge Connected Subgraph Polyhedra

✍ M. Didi Biha; A.R. Mahjoub 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 91 KB

On Shortest k-Edge-Connected Steiner Net

On Shortest k-Edge-Connected Steiner Networks in Metric Spaces

✍ Xiufeng Du; Xiaodong Hu; Xiaohua Jia 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 69 KB

On Minimum-Weight k-Edge Connected Stein

On Minimum-Weight k-Edge Connected Steiner Networks on Metric Spaces

✍ D. Frank Hsu; Xiao-Dong Hu; Guo-Hui Lin 📂 Article 📅 2000 🏛 Springer Japan 🌐 English ⚖ 98 KB

On two-connected subgraph polytopes

✍ Francisco Barahona; Ali Ridha Mahjoub 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 674 KB

We further study some known families of valid inequalities for the 2-edge-connected and 2-node-connected subgraph polytopes. For the 2-edge-connected case, we show that the odd wheel inequalities together with the obvious constraints give a complete description of the polytope for Halin graphs. For

On edge-antipodald-polytopes

✍ Tibor Bisztriczky; Károly Böröczky 📂 Article 📅 2008 🏛 Springer Netherlands 🌐 English ⚖ 365 KB