Improved Algorithm for Degree Bounded Survivable Network Design Problem
From MaRDI portal
Publication:3569909
DOI10.1007/978-3-642-13731-0_38zbMath1285.68124arXiv0911.4544OpenAlexW3122273056MaRDI QIDQ3569909
Anand Louis, Nisheeth K. Vishnoi
Publication date: 22 June 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0911.4544
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (8)
Approximation Algorithms for Multi-budgeted Network Design Problems ⋮ On some network design problems with degree constraints ⋮ A Spectral Approach to Network Design ⋮ Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design ⋮ A unified algorithm for degree bounded survivable network design ⋮ Degree constrained node-connectivity problems ⋮ Binary Steiner trees: structural results and an exact solution approach ⋮ Network-Design with Degree Constraints
This page was built for publication: Improved Algorithm for Degree Bounded Survivable Network Design Problem
