24 search results - page 1 / 5 » Approximation via cost sharing: Simpler and better approxima... |
JACM
2007
13 years 4 months ago
2007
STOC
2003
ACM
14 years 5 months ago
2003
ACM
APPROX
2004
Springer
13 years 10 months ago
2004
Springer
We consider a single-source network design problem from a game-theoretic perspective. Gupta, Kumar and Roughgarden (Proc. 35th Annual ACM STOC, pages 365–372, 2003) developed a ...
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
ESA
2004
Springer
13 years 10 months ago
2004
Springer
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...