An 813-approximation algorithm for the asymmetric maximum TSP

Author： Blaser M.  

Publisher： Elsevier

ISSN： 0196-6774

Source： Journal of Algorithms, Vol.50, Iss.1, 2004-01, pp. : 23-48

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

An Improved Randomized Approximation Algorithm for Max TSP

By Chen Zhi-Zhong   Wang Lusheng  

Journal of Combinatorial Optimization, Vol. 9, Iss. 4, 2005-06 ,pp. : 401-432

Springer Publishing Company

Access to resources Recommend Favorite

An almost four-approximation algorithm for maximum weight triangulation

By Hu Shiyan  

Journal of Combinatorial Optimization, Vol. 19, Iss. 1, 2010-01 ,pp. : 31-42

Springer Publishing Company

Access to resources Recommend Favorite

Improved approximation algorithms for metric MaxTSP

By Chen Zhi-Zhong   Nagoya Takayuki  

Journal of Combinatorial Optimization, Vol. 13, Iss. 4, 2007-05 ,pp. : 321-336

Springer Publishing Company

Access to resources Recommend Favorite

An Algorithm for the Maximum Likelihood Problem on Evolutionary Trees

By Oliveira Carlos  

Journal of Combinatorial Optimization, Vol. 10, Iss. 1, 2005-08 ,pp. : 61-75

Springer Publishing Company

Access to resources Recommend Favorite

A simulated annealing algorithm for the maximum planar subgraph problem

By Poranen T.  

International Journal of Computer Mathematics, Vol. 81, Iss. 5, 2004-05 ,pp. : 555-568

Taylor & Francis Ltd

Access to resources Recommend Favorite