53 search results - page 1 / 11 » Approximating Graphic TSP by Matchings |
CORR
2011
Springer
12 years 11 months ago
2011
Springer
We present a framework for approximating the metric TSP based on a novel use of matchings. Traditionally, matchings have been used to add edges in order to make a given graph Eule...
CORR
2012
Springer
12 years 6 days ago
2012
Springer
We develop a new method for proving explicit approximation lower bounds for TSP problems with bounded metrics improving on the best up to now known bounds. They almost match the b...
TSP
2010
12 years 11 months ago
2010
Sparse graphical models have proven to be a flexible class of multivariate probability models for approximating high-dimensional distributions. In this paper, we propose techniques...
TSP
2008
13 years 4 months ago
2008
This article introduces the concept of sensing dictionaries. It presents an alteration of greedy algorithms like thresholding or (Orthogonal) Matching Pursuit which improves their...
CVPR
2004
IEEE
14 years 6 months ago
2004
IEEE
This paper explores a formulation for attributed graph matching as an inference problem over a hidden Markov Random Field. We approximate the fully connected model with simpler mo...