76 search results - page 11 / 16 » Approximating the Minimum Spanning Tree Weight in Sublinear ... |
126
click to vote
STACS
2001
Springer
15 years 5 months ago
2001
Springer
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
116
click to vote
ISAAC
2004
Springer
15 years 6 months ago
2004
Springer
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
110
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...
132
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We introduce a problem that is a common generalization of the uncapacitated facility location (UFL) and minimum latency (ML) problems, where facilities not only need to be opened ...
127
click to vote
CATS
2006
15 years 2 months ago
2006
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...