Concepedia
Discrete Optimization · 2004 · 143 citations · 8 references
ComputingComputer ScienceAlgorithmsOptimizationApproximation AlgorithmsGreedy AlgorithmsOptimization TheoryGreedy ApproximationGreedy Heuristics
8
Complexity and approximation: Combinatorial optimization problems and their approximability properties
Computers & Mathematics with Applications · 2000 · 1.3K citations
Computing, Computer Science, Mathematics +13
The Traveling Salesman Problem with Distances One and Two
Christos H. Papadimitriou, Mihalis Yannakakis · Mathematics of Operations Research · 1993 · 417 citations
Computing, Computer Science, Mathematics +12
Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP
Gregory Gutin, Anders Yeo, Alexey Zverovich · Discrete Applied Mathematics · 2002 · 240 citations
Natural Sciences, Computer Science, Mathematics +11
TSP Heuristics: Domination Analysis and Complexity
Punnen, Margot, Kabadi · Algorithmica · 2002 · 60 citations
Computing, Computer Science, Algorithms +13
Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number
Gregory Gutin, Anders Yeo · Discrete Applied Mathematics · 2002 · 57 citations