676 search results - page 59 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
157
click to vote
FSTTCS
2004
Springer
15 years 11 months ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
145
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
The concept of graph cuts is by now a standard method
for all sorts of low level vision problems. Its popularity is
largely due to the fact that globally or near globally optimal...
161
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
160
click to vote
MOC
2000
15 years 6 months ago
2000
How close are Galerkin eigenvectors to the best approximation available out of the trial subspace? Under a variety of conditions the Galerkin method gives an approximate eigenvecto...
169
click to vote
JDA
2008
15 years 5 months ago
2008
Abstract. Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evolution. Analysis of genomes evolving by reversals and transpositions leads to a ...