The Complexity of the Lin–Kernighan Heuristic for the Traveling Salesman Problem
Work
Year: 1992
Type: article
Source: SIAM Journal on Computing
Author Christos H. Papadimitriou
Institution University of California, San Diego
Cites: 9
Cited by: 91
Related to: 10
FWCI: 3.133
Citation percentile (by year/subfield): 95.41
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed