Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

32

CORR
2011
Springer

favoriteEmaildiscussreport

256views Education» more CORR 2011»

Approximating Graphic TSP by Matchings

13 years 5 months ago

Approximating Graphic TSP by Matchings

Download www.csc.kth.se

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 Eulerian, whereas our approach also allows for the removal of certain edges leading to a decreased cost.

Tobias Mömke, Ola Svensson

Real-time Traffic

CORR 2011 | Education | Graph Eulerian | Metric Tsp |

claim paper

Related Content

» On Approximation Lower Bounds for TSP with Bounded Metrics

» Learning graphical models for hypothesis testing and classification

» Dictionary Preconditioning for Greedy Algorithms

» Graphical Models for Graph Matching

» Graphical Models and Point Pattern Matching

» Image Flows and OneLiner Graphical Image Representation

» Independent component analysis by entropy bound minimization

» Adaptive design of OFDM radar signal with improved wideband ambiguity function

» A Bayesian Approach to Adaptive Detection in Nonhomogeneous Environments

Post Info
More Details (n/a)

Added	13 May 2011
Updated	13 May 2011
Type	Journal
Year	2011
Where	CORR
Authors	Tobias Mömke, Ola Svensson

Comments (0)