scientific article; zbMATH DE number 5485591

MaRDI QIDQ5302102zbMATH OpenFDO

Authors N. Bansal, Rohit Khandekar, Viswanath Nagarajan

Publication date 5 January 2009

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(9)

• 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
• New approaches to multi-objective optimization
• Approximating minimum bounded degree spanning trees to within one of optimal
• Approximating directed weighted-degree constrained networks

This page was built for publication:

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