✦ LIBER ✦

Bounded-Diameter Minimum-Cost Graph Problems

✍ Scribed by Sanjiv Kapoor; Mohammad Sarwat

Publisher: Springer
Year: 2007
Tongue: English
Weight: 228 KB
Volume: 41
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-006-1305-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the minimum-cardinality-bounded-diame

On the minimum-cardinality-bounded-diameter and the bounded-cardinality-minimum-diameter edge addition problems

✍ Chung-Lun Li; S.Thomas McCormick; David Simchi-Levi 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 331 KB

Approximating minimum-cost graph problem

Approximating minimum-cost graph problems with spanning tree edges

✍ Michel X. Goemans; David P. Williamson 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 435 KB

Approximating the Degree-Bounded Minimum

Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem

✍ Jochen Könemann; Asaf Levin; Amitabh Sinha 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 944 KB

Minimum-diameter covering problems

✍ Esther M. Arkin; Refael Hassin 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 181 KB

Improved heuristics for the bounded-diam

Improved heuristics for the bounded-diameter minimum spanning tree problem

✍ Alok Singh; Ashok K. Gupta 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 423 KB

Minimum vertex-diameter-2-critical graph

Minimum vertex-diameter-2-critical graphs

✍ Ya-Chen Chen; Zoltán Füredi 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 182 KB 👁 1 views

## Abstract We prove that the minimum number of edges in a vertex‐diameter‐2‐critical graph on __n__ ≥ 23 vertices is (5__n__ − 17)/2 if __n__ is odd, and is (5__n__/2) − 7 if __n__ is even. © 2005 Wiley Periodicals, Inc. J Graph Theory