Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

113

Voted

IPCO
2010

123views Optimization» more IPCO 2010»

On Generalizations of Network Design Problems with Degree Bounds

15 years 3 months ago

On Generalizations of Network Design Problems with Degree Bounds

Download domino.research.ibm.com

Nikhil Bansal, Rohit Khandekar, Jochen Könema

Real-time Traffic

IPCO 2010 | Optimization |

claim paper

Related Content

» Degree Bounded Network Design with Metric Costs

» Improved Algorithm for Degree Bounded Survivable Network Design Problem

» Routing and Wavelength Assignment in Generalized WDM Tree Networks of Bounded Degree

» Localized construction of bounded degree and planar spanner for wireless ad hoc networks

» Approximating minimum bounded degree spanning trees to within one of optimal

» A Primal BranchandCut Algorithm for the DegreeConstrained Minimum Spanning Tree Problem

» Minimum Maximum Degree PublishSubscribe Overlay Network Design

» P2P Streaming Capacity under Node Degree Bound

» Primaldual meets local search approximating MSTs with nonuniform degree bounds

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2010
Where	IPCO
Authors	Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis

Comments (0)