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

Approximation Algorithms for Network Design with Metric Costs

โœ Scribed by Cheriyan, Joseph; Vetta, Adrian

Book ID
118196887
Publisher
Society for Industrial and Applied Mathematics
Year
2007
Tongue
English
Weight
325 KB
Volume
21
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Degree Bounded Network Design with Metri
Degree Bounded Network Design with Metric Costs
โœ Chan, Yuk Hei; Fung, Wai Shing; Lau, Lap Chi; Yung, Chun Kong ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 384 KB
Cost-Distance: Two Metric Network Design
Cost-Distance: Two Metric Network Design
โœ Meyerson, Adam; Munagala, Kamesh; Plotkin, Serge ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 198 KB
Approximation Algorithms for Network Des
Approximation Algorithms for Network Design Problems on Bounded Subsets
โœ Dorit S. Hochbaum; Joseph (Seffi) Naor ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 141 KB

We address the problem of designing a network so that certain connectivity requirements are satisfied, at minimum cost of the edges used. The requirements are specified for each subset of vertices in terms of the number of edges with one endpoint in the set. We address a class of such problems, wher