4843 search results - page 330 / 969 » The Shortcut Problem - Complexity and Approximation |
122
click to vote
FOCS
2006
IEEE
15 years 10 months 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...
129
click to vote
SWAT
2004
Springer
15 years 9 months 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...
127
click to vote
ICALP
2010
Springer
15 years 9 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...
115
click to vote
ICCAD
1995
IEEE
15 years 7 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...
134
click to vote
JAIR
2006
15 years 4 months ago
2006
Efficient representations and solutions for large decision problems with continuous and discrete variables are among the most important challenges faced by the designers of automa...