3875 search results - page 319 / 775 » Approximation algorithms for the 0-extension problem |
177
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
We study the Unsplittable Flow Problem (UFP) on a line graph, focusing on the long-standing open question of whether the problem is APX-hard. We describe a deterministic quasi-pol...
179
click to vote
FOCS
2006
IEEE
16 years 26 days ago
2006
IEEE
We investigate the optimality of (1+ )-approximation algorithms obtained via the dimensionality reduction method. We show that: • Any data structure for the (1 + )-approximate n...
179
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We consider the clustering with diversity problem: given a set of colored points in a metric space, partition them into clusters such that each cluster has at least point...
162
click to vote
SWAT
2004
Springer
16 years 4 days ago
2004
Springer
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...
181
click to vote
ISCAS
2005
IEEE
16 years 12 days ago
2005
IEEE
— Simulated Evolution (SimE) is a sound stochastic approximation algorithm based on the principles of adaptation. If properly engineered it is possible for SimE to reach nearopti...