5595 search results - page 177 / 1119 » Approximation Algorithms for Clustering Problems |
166
click to vote
SSDBM
2005
IEEE
15 years 10 months ago
2005
IEEE
Modern geographic information systems do not only have to handle static information but also dynamically moving objects. Clustering algorithms for these moving objects provide new...
141
click to vote
APPROX
2008
Springer
15 years 7 months ago
2008
Springer
We present the first 7/8-approximation algorithm for the maximum traveling salesman problem with triangle inequality. Our algorithm is deterministic. This improves over both the r...
187
click to vote
CLUSTER
2007
IEEE
15 years 11 months ago
2007
IEEE
— In this article we tackle the problem of scheduling a dynamically generated DAG of multi-processor tasks (M-tasks). At first, we outline the need of such a scheduling approach...
145
Voted
STOC
2006
ACM
15 years 11 months ago
2006
ACM
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
135
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
Recently, a convergence proof of stochastic search algorithms toward finite size Pareto set approximations of continuous multi-objective optimization problems has been given. The...