570 search results - page 23 / 114 » Approximating Some Network Design Problems with Node Costs |
139
click to vote
PE
1998
Springer
15 years 1 months ago
1998
Springer
Asymptotic approximations are constructed for the performance measures of product form queueing networks consisting of single server, fixed rate nodes with large populations. The...
105
click to vote
DSN
2007
IEEE
15 years 7 months ago
2007
IEEE
Modularity is a desirable property of complex software systems, since it simplifies code reuse, verification, maintenance, etc. However, the use of loosely coupled modules intro...
IJWIN
2007
15 years 1 months ago
2007
— We analyze the asymptotic cost of discovering a route within a flat ad hoc network and we show that one can discover a route with cost that is proportional only to the area of...
113
click to vote
GECCO
2004
Springer
15 years 6 months ago
2004
Springer
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
113
click to vote
SIAMCOMP
2008
15 years 1 months ago
2008
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...