3875 search results - page 306 / 775 » Approximation algorithms for the 0-extension problem |
167
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
164
click to vote
ATMOS
2010
15 years 5 months ago
2010
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
307
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
We propose a framework for compressive sensing of images with local geometric features. Specifically, let x ∈ RN be an N-pixel image, where each pixel p has value xp. The image...
196
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
In Combinatorial Public Projects, there is a set of projects that may be undertaken, and a set of selfinterested players with a stake in the set of projects chosen. A public plann...
173
click to vote
JDA
2011
15 years 1 months ago
2011
It has recently been shown how to construct online, non-amortised approximate pattern matching algorithms for a class of problems whose distance functions can be classified as be...