Greedy-type resistance of combinatorial problems

Authors:
Gareth Bendall;FrançOis Margot
Affiliations:
Department of Mathematics, University of Kentucky, 715 POT, Lexington, KY 40506, United States;Department of Mathematics, University of Kentucky, 715 POT, Lexington, KY 40506, United States
Venue:
Discrete Optimization
Year:
2006

Citing 6
Cited 3

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Domination analysis of combinatorial optimization problems

Discrete Applied Mathematics
Combinatorial Optimization: Theory and Algorithms

Combinatorial Optimization: Theory and Algorithms
When the greedy algorithm fails

Discrete Optimization
Anti-matroids

Operations Research Letters

Worst case analysis of Max-Regret, Greedy and other heuristics for Multidimensional Assignment and Traveling Salesman Problems

Journal of Heuristics
Predicting protein complexes in protein interaction networks using a core-attachment algorithm based on graph communicability

Information Sciences: an International Journal
Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems

WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper gives a sufficient condition for a combinatorial problem to be greedy-type resistant, i.e. such that, on some instances of the problem, any greedy-type algorithm will output the unique worst possible solution. The condition is used to show that the Equipartition, the k-Clique, the Asymmetric Traveling Salesman, the Hamiltonian Path, the Min-Max Matching, and the Assignment Problems are all greedy-type resistant.