Survivable network design problems with weighted degree constraints

MaRDI QIDQ2999651zbMATH OpenFDO

Authors Takuro Fukunaga, Hiroshi Nagamochi

Publication date 16 May 2011

zbMATH Keywords

degree constraintedge connectivityiterative roundingnetwork design

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27)

Recommendations

• Network design with weighted degree constraints
• Network Design with Weighted Degree Constraints
• Computing and Combinatorics
• Survivable network design with degree or order constraints

Cited in

(8)

• Network Design with Weighted Degree Constraints
• Network design with weighted degree constraints
• Node-weighted Network Design in Planar and Minor-closed Families of Graphs
• A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints
• Additive Approximation for Bounded Degree Survivable Network Design
• A graph theory approach for designing conservation reserve networks with minimal fragmentation
• Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems
• A surrogate and Lagrangian approach to constrained network problems

This page was built for publication: Survivable network design problems with weighted degree constraints

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