666 search results - page 32 / 134 » New primal-dual algorithms for Steiner tree problems |
INFOCOM
2010
IEEE
13 years 8 months ago
2010
IEEE
Abstract—Wireless mesh networks are popular as a costeffective means to provide broadband connectivity to large user populations. A mesh network placement provides coverage, such...
ICCAD
2007
IEEE
14 years 7 months ago
2007
IEEE
Global routing is an important step in the physical design process. In this paper, we propose a new global routing algorithm Archer, which resolves some of the most common problem...
SODA
2003
ACM
13 years 11 months ago
2003
ACM
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
ESA
2007
Springer
14 years 4 months ago
2007
Springer
Consider the following network subscription pricing problem. We are given a graph G = (V, E) with a root r, and potential customers are companies headquartered at r with locations...
APPROX
2004
Springer
14 years 3 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 ...