90 search results - page 1 / 18 » An improved approximation ratio for the minimum linear arran... |
IPL
2007
13 years 4 months ago
2007
We observe that combining the techniques of Arora, Rao, and Vazirani, with the rounding algorithm of Rao and Richa yields an O( √ log n log log n)-approximation for the minimum-...
IJSNET
2008
13 years 4 months ago
2008
: Suppose we need to watch a set of targets continuously for a required period of time, and suppose we choose any number of sensors from a fixed set of sensor types and place them ...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
SIAMCOMP
2011
12 years 7 months ago
2011
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
COR
2008
13 years 5 months ago
2008
In this paper, an improved Two-Stage Simulated Annealing algorithm is presented for the Minimum Linear Arrangement Problem for Graphs. This algorithm integrates several distinguis...