Publication:5302102
From MaRDI portal
zbMath1231.68046MaRDI QIDQ5302102
Viswanath Nagarajan, Rohit Khandekar, Nikhil Bansal
Publication date: 5 January 2009
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
Related Items
Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal, New approaches to multi-objective optimization, Approximating directed weighted-degree constrained networks, A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids, Graphs and Algorithms in Communication Networks on Seven League Boots, A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem, Approximating Directed Weighted-Degree Constrained Networks, Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees, Network Design with Weighted Degree Constraints