| Document Date: 2011-04-15 11:31:50
Open Document File Size: 602,94 KBShare Result on Facebook
/ Facility Ola Svensson Royal Institute of Technology / / IndustryTerm extreme point solution / circulation network / r-approximation algorithm / depth-first search tree / approximation algorithm / feasible solution / polynomial time approximation algorithm / polynomial time algorithm / depth-first search / flow network / certain circulation network / depth-first-search tree / search tree / r-approximate solution / improved approximation algorithm / / Organization Institute of Technology / OP TLP / / Person Ola Svensson / / / Position investigator / General / salesman / / ProgrammingLanguage TSP / / Technology 1.5-approximation algorithm / proposed algorithm / polynomial time algorithm / 7/5-approximation algorithm / approximation algorithm / 5 Improved Approximation Algorithms / improved approximation algorithm / polynomial time 4/3-approximation algorithm / 1.586-approximation algorithm / polynomial time approximation algorithm / r-approximation algorithm / 1.461-approximation algorithm / /
SocialTag |
Approximating Graphic TSP by Matchings∗ Tobias M¨omke and Ola Svensson Royal Institute of Technology - KTH, Stockholm, Sweden {moemke,osven}@kth.se April 15, 2011