Approximating Some Network Design Problems with Node Costs

14 years 5 months ago

Download crab.rutgers.edu

We study several multi-criteria undirected network design problems with node costs and lengths. All these problems are related to the Multicommodity Buy at Bulk (MBB) problem in which we are given a graph

Guy Kortsarz, Zeev Nutov

Real-time Traffic

Algorithms | APPROX 2009 | Chekuri Et | Multi-criteria Undirected Network | Problems |

claim paper

» Network Design via Core Detouring for Problems without a Core

» Relay node placement in large scale wireless sensor networks

» Solving the Capacitated Local Access Network Design Problem

» Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs Const...

» Approximating minimumpower edgemulticovers

» Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem

» On the approximability of some network design problems

» Path Decomposition Under a New Cost Measure with Applications to Optical Network Design

Post Info
More Details (n/a)

Added	25 May 2010
Updated	25 May 2010
Type	Conference
Year	2009
Where	APPROX
Authors	Guy Kortsarz, Zeev Nutov

Comments (0)

Sciweavers

Approximating Some Network Design Problems with Node Costs

Algorithms | APPROX 2009 | Chekuri Et | Multi-criteria Undirected Network | Problems |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers