Network Design with Edge-Connectivity and Degree Constraints

DOI10.1007/11970125_15MaRDI QIDQ5443519zbMATH OpenOpenAlexFDO

Authors Takuro Fukunaga, Hiroshi Nagamochi

Publication date 21 February 2008

Published in Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.498.2387

Mathematics Subject Classification ID

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

Recommendations

• Network design with edge-connectivity and degree constraints
• Network-design with degree constraints
• On some network design problems with degree constraints
• Network Design with Weighted Degree Constraints
• Network design with weighted degree constraints
• Degree constrained node-connectivity problems
• Degree-constrained node-connectivity
• On approximating degree-bounded network design problems

Cited in

(7)

• Design networks with bounded pairwise distance
• Degree bounded network design with metric costs
• The phases of large networks with edge and triangle constraints
• scientific article; zbMATH DE number 6423757 (Why is no real title available?)
• scientific article; zbMATH DE number 5176323 (Why is no real title available?)
• APPROXIMATING MINIMUM COST MULTIGRAPHS OF SPECIFIED EDGE-CONNECTIVITY UNDER DEGREE BOUNDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
• Network design with edge-connectivity and degree constraints

This page was built for publication: Network Design with Edge-Connectivity and Degree Constraints

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