Greedy-type resistance of combinatorial problems
- 1 December 2006
- journal article
- Published by Elsevier in Discrete Optimization
- Vol. 3 (4) , 288-298
- https://doi.org/10.1016/j.disopt.2006.03.001
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- When the greedy algorithm failsDiscrete Optimization, 2004
- Domination analysis of combinatorial optimization problemsDiscrete Applied Mathematics, 2003
- TSP Heuristics: Domination Analysis and ComplexityAlgorithmica, 2003
- Anti-matroidsOperations Research Letters, 2002
- Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSPDiscrete Applied Mathematics, 2002
- The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithmsJournal of the Operational Research Society, 1997