scientific article; zbMATH DE number 5485590

zbMath1231.68286MaRDI QIDQ5302101

Mohit Singh, Lap Chi Lau

Publication date: 5 January 2009

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Approximation algorithms (68W25)

Related Items

Approximation Algorithms for Multi-budgeted Network Design Problems, On some network design problems with degree constraints, On generalizations of network design problems with degree bounds, New approaches to multi-objective optimization, Network design with weighted degree constraints, Degree constrained node-connectivity problems, Approximating Minimum Cost Source Location Problems with Local Vertex-Connectivity Demands, Binary Steiner trees: structural results and an exact solution approach, Network Design with Weighted Degree Constraints, Network-Design with Degree Constraints, A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids, Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal, Unnamed Item