667 search results - page 45 / 134 » Approximation algorithms for connected facility location pro... |
148
click to vote
SIGMOD
2010
ACM
15 years 3 months ago
2010
ACM
Trajectory search has long been an attractive and challenging topic which blooms various interesting applications in spatial-temporal databases. In this work, we study a new probl...
124
click to vote
COCOON
2008
Springer
15 years 4 months ago
2008
Springer
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
108
click to vote
COR
2006
15 years 3 months ago
2006
We consider an obnoxious facility location problem in which the facility is a trajectory consisting of a bounded length polygonal chain of two edges having extremes anchored at tw...
116
click to vote
JPDC
2007
15 years 2 months ago
2007
We study the problem of scheduling unit size jobs on n processors connected by a ring. We show a distributed algorithm for this problem with an approximation ratio of 3 2 + √ 2....
145
click to vote
ML
2008
ACM
15 years 3 months ago
2008
ACM
It is well-known that heuristic search in ILP is prone to plateau phenomena. An explanation can be given after the work of Giordana and Saitta: the ILP covering test is NP-complete...