Sciweavers

1388 search results - page 8 / 278
» Approximability of Robust Network Design
Sort
View
MOR
2007
149views more  MOR 2007»
13 years 7 months ago
LP Rounding Approximation Algorithms for Stochastic Network Design
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
Anupam Gupta, R. Ravi, Amitabh Sinha
STOC
2003
ACM
100views Algorithms» more  STOC 2003»
14 years 7 months ago
Simpler and better approximation algorithms for network design
Anupam Gupta, Amit Kumar, Tim Roughgarden
APPROX
2009
Springer
145views Algorithms» more  APPROX 2009»
14 years 2 months ago
Approximating Some Network Design Problems with Node Costs
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 w...
Guy Kortsarz, Zeev Nutov
VLSID
2006
IEEE
148views VLSI» more  VLSID 2006»
14 years 7 months ago
Efficient Design and Analysis of Robust Power Distribution Meshes
With increasing design complexity, as well as continued scaling of supplies, the design and analysis of power/ground distribution networks poses a difficult problem in modern IC d...
Puneet Gupta, Andrew B. Kahng
ICCAD
2005
IEEE
98views Hardware» more  ICCAD 2005»
14 years 4 months ago
Statistical based link insertion for robust clock network design
We present a statistical based non-tree clock distribution construction algorithm that starts with a tree and incrementally insert cross links, such that the skew variation of the...
Wai-Ching Douglas Lam, J. Jam, Cheng-Kok Koh, Venk...