3875 search results - page 48 / 775 » Approximation algorithms for the 0-extension problem |
167
Voted
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
—In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol and physical models. We give the first distribut...
127
click to vote
SODA
2004
ACM
15 years 5 months ago
2004
ACM
We propose a quasi-greedy algorithm for approximating the classical uncapacitated 2-level facility location problem (2-LFLP). Our algorithm, unlike the standard greedy algorithm, ...
125
click to vote
JCSS
2010
15 years 2 months ago
2010
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
144
click to vote
DAM
1999
15 years 3 months ago
1999
This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of vertices in a graph. Exact solutions or logar...