Sciweavers

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

11

OL
2008

favoriteEmaildiscussreport

82views more OL 2008»

An approximation algorithm for network design problems with downwards-monotone demand functions

13 years 4 months ago

An approximation algorithm for network design problems with downwards-monotone demand functions

Download scis.nova.edu

Building on an existing 2-approximate algorithm for the class of network design problems with downwards-monotone demand functions, many of which are NP-hard, we present an algorithm that produces solutions that are at least as good as and typically better than solutions produced by the existing algorithm. Keywords Network design problems

Michael Laszlo, Sumitra Mukherjee

Real-time Traffic

Algorithms | Downwards-monotone Demand Functions | Network Design Problems | OL 2008 |

claim paper

Related Content

» MinimumCost Network Design with Diseconomies of Scale

» Approximability of Robust Network Design

» Approximation Algorithms for BuyatBulk Geometric Network Design

» Approximation Algorithms for NonUniform BuyatBulk Network Design

» LP Rounding Approximation Algorithms for Stochastic Network Design

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

» Oblivious BuyatBulk in Planar Graphs

» BuyatBulk Network Design with Protection

» Algorithmic Aspects of Access Networks Design in B3G4G Cellular Networks

Post Info
More Details (n/a)

Added	28 Dec 2010
Updated	28 Dec 2010
Type	Journal
Year	2008
Where	OL
Authors	Michael Laszlo, Sumitra Mukherjee

Comments (0)