𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Critical edges/nodes for the minimum spanning tree problem: complexity and approximation

✍ Scribed by Cristina Bazgan, Sonia Toubaline…

Book ID
120694120
Publisher
Springer US
Year
2012
Tongue
English
Weight
487 KB
Volume
26
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Better Approximation Ratio for the Min
A Better Approximation Ratio for the Minimum Sizek-Edge-Connected Spanning Subgraph Problem
✍ Cristina G Fernandes 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 213 KB

Consider the minimum size k-edge-connected spanning subgraph problem: given a positive integer k and a k-edge-connected graph G, find a k-edge-connected spanning subgraph of G with the minimum number of edges. This problem is known to be NP-complete. Khuller and Raghavachari presented the first algo