Sciweavers

Share
25 search results - page 1 / 5
» Improved Approximation Algorithms for Metric Maximum ATSP an...
Sort
View
WADS
2005
Springer
187views Algorithms» more  WADS 2005»
10 years 13 days ago
Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems
We consider an APX-hard variant (‚ąÜ-Max-ATSP) and an APX-hard relaxation (Max-3-DCC) of the classical traveling salesman problem. We present a 31 40-approximation algorithm for ‚...
Markus Bläser, L. Shankar Ram, Maxim Sviriden...
WADS
2007
Springer
189views Algorithms» more  WADS 2007»
10 years 1 months ago
35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality
We describe a new approximation algorithm for the asymmetric maximum traveling salesman problem (ATSP) with triangle inequality. Our algorithm achieves approximation factor 35/44 ...
Lukasz Kowalik, Marcin Mucha
APPROX
2008
Springer
142views Algorithms» more  APPROX 2008»
9 years 9 months ago
Approximating Maximum Subgraphs without Short Cycles
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
Guy Kortsarz, Michael Langberg, Zeev Nutov
IPL
2011
112views more  IPL 2011»
9 years 1 months ago
Improved approximation algorithms for minimum AND-circuits problem via k-set cover
Arpe and Manthey [Algorithmica’09] recently studied the minimum ANDcircuit problem, which is a circuit minimization problem, and showed some results including approximation algo...
Hiroki Morizumi
FSTTCS
2004
Springer
10 years 10 days ago
Improved Approximation Algorithms for Maximum Graph Partitioning Problems
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semideÔ¨Ānite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
Gerold Jäger, Anand Srivastav
books