A unified algorithm for degree bounded survivable network design

DOI10.1007/978-3-319-07557-0_31MaRDI QIDQ5419010zbMATH OpenOpenAlexFDO

Authors Lap Chi Lau, Hong Zhou

Publication date 2 June 2014

Published in Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-07557-0_31

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A unified algorithm for degree bounded survivable network design
• scientific article; zbMATH DE number 1263260
• Improved algorithm for degree bounded survivable network design problem
• Additive Approximation for Bounded Degree Survivable Network Design
• Degree bounded network design with metric costs

Cited in

(10)

• Approximating bounded-degree spanning trees and connected factors with leaves
• Approximation algorithms for connected graph factors of minimum weight
• Complexity of column generation in network design with path-based survivability mechanisms
• Iterative rounding approximation algorithms for degree-bounded node-connectivity network design
• Improved algorithm for degree bounded survivable network design problem
• Online and Stochastic Survivable Network Design
• Additive Approximation for Bounded Degree Survivable Network Design
• Approximating survivable networks with \(\beta \)-metric costs
• Designing survivable networks with zero-suppressed binary decision diagrams
• A unified algorithm for degree bounded survivable network design

This page was built for publication: A unified algorithm for degree bounded survivable network design

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