๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A better subgraph of the minimum weight triangulation

โœ Scribed by Yang Bo-Ting


Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
269 KB
Volume
56
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A Better Approximation Ratio for the Min
โœ 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