The Parameterized Complexity of Local Search for TSP, More Refined

ISSN： 0178-4617

Source： Algorithmica, Vol.67, Iss.1, 2013-09, pp. : 89-110

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

Abstract

Related content

Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties

By Marx Dániel Schlotter Ildikó

Algorithmica, Vol. 58, Iss. 1, 2010-09 ,pp. : 170-187

Springer Publishing Company

Access to resources Recommend Favorite

Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem

By Angel E. Bampis E. Gourves L.

Theoretical Computer Science, Vol. 310, Iss. 1, 2004-01 ,pp. : 135-146

Elsevier

Access to resources Recommend Favorite

The Turing way to parameterized complexity

By Cesati M.

Journal of Computer and System Sciences, Vol. 67, Iss. 4, 2003-12 ,pp. : 654-685

Elsevier

Access to resources Recommend Favorite

The Parameterized Complexity of the Shared Center Problem

By Chen Zhi-Zhong Ma Wenji Wang Lusheng

Algorithmica, Vol. 69, Iss. 2, 2014-06 ,pp. : 269-293

Springer Publishing Company

Access to resources Recommend Favorite

The parameterized complexity of sequence alignment and consensus

By Bodlaender H.L. Downey R.G. Fellows M.R. Wareham H.T.

Theoretical Computer Science, Vol. 147, Iss. 1, 1995-08 ,pp. : 31-54

Elsevier

Access to resources Recommend Favorite