316 search results - page 15 / 64 » Approximation algorithms for hierarchical location problems |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We provide an O(log log OPT)-approximation algorithm for the problem of guarding a simple polygon with guards on the perimeter. We first design a polynomial-time algorithm for bui...
GLOBECOM
2008
IEEE
13 years 8 months ago
2008
IEEE
—In next generation wireless networks, not only wide area cells to provide moderate data rate with full mobility but also local area cells to support high data rate with local mo...
CIAC
2010
Springer
14 years 10 days ago
2010
Springer
A weighted sequence is a string in which a set of characters may appear at each position with respective probabilities of occurrence. A common task is to locate a given motif in a ...
APPROX
2005
Springer
14 years 1 months ago
2005
Springer
The field of stochastic optimization studies decision making under uncertainty, when only probabilistic information about the future is available. Finding approximate solutions to...
COCOON
2004
Springer
13 years 11 months ago
2004
Springer
In this work, we study an extension of the k-center facility location problem, where centers are required to service a minimum of clients. This problem is motivated by requirement...