A Unified Algorithm for Degree Bounded Survivable Network Design

DOI10.1007/978-3-319-07557-0_31zbMath1418.90276OpenAlexW2174216991MaRDI QIDQ5419010

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)

Related Items (3)

Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design ⋮ Approximating bounded-degree spanning trees and connected factors with leaves ⋮ Approximation algorithms for connected graph factors of minimum weight

This page was built for publication: A Unified Algorithm for Degree Bounded Survivable Network Design