When the greedy algorithm fails

Authors:
JøRgen Bang-Jensen;Gregory Gutin;Anders Yeo
Affiliations:
Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark;Department of Computer Science, Royal Holloway, University of London, Egham, Surrey TW20 0EX, UK;Department of Computer Science, Royal Holloway, University of London, Egham, Surrey TW20 0EX, UK
Venue:
Discrete Optimization
Year:
2004

Citing 7
Cited 8

An approximation algorithm for the asymmetric travelling salesman problem with distances one and two

Information Processing Letters
The traveling salesman problem with distances one and two

Mathematics of Operations Research
Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number

Discrete Applied Mathematics
Domination analysis of some heuristics for the traveling salesman problem

Discrete Applied Mathematics
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Approximation Hardness of TSP with Bounded Metrics

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Anti-matroids

Operations Research Letters

Nearly homogeneous multi-partitioning with a deterministic generator

Neurocomputing
Optimizing interpreters by tuning opcode orderings on virtual machines for modern architectures: or: how I learned to stop worrying and love hill climbing

Proceedings of the 9th International Conference on Principles and Practice of Programming in Java
Algorithms of discrete optimization and their application to problems with fuzzy coefficients

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
Minimum number of below average triangles in a weighted complete graph

Discrete Optimization
Greedy-type resistance of combinatorial problems

Discrete Optimization
Exact algorithms and heuristics for the Quadratic Traveling Salesman Problem with an application in bioinformatics

Discrete Applied Mathematics
Ad hoc node connectivity improvement analysis - Why not through mesh clients?

Computers and Electrical Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide a characterization of the cases when the greedy algorithm may produce the unique worst possible solution for the problem of finding a minimum weight base in an independence system when the weights are taken from a finite range. We apply this theorem to TSP and the minimum bisection problem. The practical message of this paper is that the greedy algorithm should be used with great care, since for many optimization problems its usage seems impractical even for generating a starting solution (that will be improved by a local search or another heuristic).