Sciweavers

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

123

Voted

TALG
2008

111views more TALG 2008»

On the approximability of some network design problems

15 years 2 months ago

On the approximability of some network design problems

Download www.cs.cmu.edu

Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh

Real-time Traffic

TALG 2008 |

claim paper

Related Content

» Approximating Some Network Design Problems with Node Costs

» Network Design via Core Detouring for Problems without a Core

» Approximation Algorithms for Some Graph Partitioning Problems

» Differential Approximation for Some Routing Problems

» Some Structural and Geometric Properties of TwoConnected Steiner Networks

» On the average case performance of some greedy approximation algorithms for the uncapacita...

» On Minimum Power Connectivity Problems

» Approximation Algorithms for NonUniform BuyatBulk Network Design

» On Optimal Quantization Rules for Some Problems in Sequential Decentralized Detection

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2008
Where	TALG
Authors	Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha

Comments (0)