Combinatorial dominance guarantees for problems with infeasible solutions

Daniel Berend, Steven S. Skiena, Yochai Twitto

Research output: Contribution to journalArticlepeer-review

6 Scopus citations

Abstract

The design and analysis of approximation algorithms for NP-hard problems is perhaps the most active research area in the theory of combinatorial algorithms. In this article, we study the notion of a combinatorial dominance guarantee as a way for assessing the performance of a given approximation algorithm. An f(n) dominance bound is a guarantee that the heuristic always returns a solution not worse than at least f(n) solutions. We give tight analysis of many heuristics, and establish novel and interesting dominance guarantees even for certain inapproximable problems and heuristic search algorithms. For example, we show that the maximal matching heuristic of VERTEX COVER offers a combinatorial dominance guarantee of 2n - (1.839 + o(1))n. We also give inapproximability results for most of the problems we discuss.

Original languageEnglish
Article number8
JournalACM Transactions on Algorithms
Volume5
Issue number1
DOIs
StatePublished - 1 Nov 2008

Keywords

  • Algorithms analysis
  • Approximation algorithms
  • Computation complexity
  • Dominance analysis

Fingerprint

Dive into the research topics of 'Combinatorial dominance guarantees for problems with infeasible solutions'. Together they form a unique fingerprint.

Cite this