Approximation Algorithms for Network Design Problems on Bounded Subsets

DOI10.1006/JAGM.1996.0050MaRDI QIDQ4895810zbMATH OpenOpenAlexFDO

Authors Dorit S. Hochbaum, Joseph (Seffi) Naor

Publication date 1996

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1996.0050

zbMATH Keywords

connectivitydirected graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 1003253
• Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements
• scientific article; zbMATH DE number 1342141
• Network design via iterative rounding of setpair relaxations

Cited in

(7)

• Approximation algorithms for a capacitated network design problem
• Algorithms for the non-bifurcated network design problem
• A 2-approximation algorithm for the network substitution problem
• Online and approximate network construction from bounded connectivity constraints
• Complexity and Approximation of the Continuous Network Design Problem
• scientific article; zbMATH DE number 1003253 (Why is no real title available?)
• Approximation algorithms for multi-budgeted network design problems

This page was built for publication: Approximation Algorithms for Network Design Problems on Bounded Subsets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4895810)