4894 search results - page 339 / 979 » The Guarding Problem - Complexity and Approximation |
171
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...
174
click to vote
FOCS
2006
IEEE
16 years 23 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...
159
click to vote
SWAT
2004
Springer
16 years 1 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...
177
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...
143
click to vote
ICCAD
1995
IEEE
15 years 10 months ago
1995
IEEE
With an ever-increasing portion of the delay in highspeed CMOS chips attributable to the interconnect, interconnect-circuit design automation continues to grow in importance. By t...