Degree-constrained node-connectivity

DOI10.1007/978-3-642-29344-3_49MaRDI QIDQ2894500zbMATH OpenOpenAlexFDO

Authors Zeev Nutov

Publication date 29 June 2012

Published in LATIN 2012: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-29344-3_49

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Connectivity (05C40)

Recommendations

• Degree constrained node-connectivity problems
• Iterative rounding approximation algorithms for degree-bounded node-connectivity network design
• Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements
• Survivable network design with degree or order constraints
• Network-design with degree constraints

Cited in

(7)

• Network Design with Edge-Connectivity and Degree Constraints
• scientific article; zbMATH DE number 866662 (Why is no real title available?)
• On some network design problems with degree constraints
• A unified algorithm for degree bounded survivable network design
• Graphs with degree constraints
• Degree constrained node-connectivity problems
• On the approximability of some degree-constrained subgraph problems

This page was built for publication: Degree-constrained node-connectivity

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