667 search results - page 43 / 134 » Approximation algorithms for connected facility location pro... |
120
click to vote
JCO
2006
15 years 3 months ago
2006
The paper addresses the relay node placement problem in two-tiered wireless sensor networks. Given a set of sensor nodes in Euclidean plane, our objective is to place minimum numbe...
109
click to vote
APPROX
2004
Springer
15 years 8 months ago
2004
Springer
We consider the problem of Simultaneous Source Location – selecting locations for sources in a capacitated graph such that a given set of demands can be satisfied. We give an ex...
104
click to vote
CORR
2010
Springer
15 years 3 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...
109
click to vote
TIT
2008
15 years 2 months ago
2008
The identifying code problem for a given graph involves finding a minimum set of vertices whose neighborhoods uniquely overlap at any given graph vertex. Initially introduced in 1...
114
click to vote
CIAC
2010
Springer
15 years 8 months 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 ...