Skip to search formSkip to main contentSkip to account menu

Approximation algorithm

Known as: Absolute performance guarantee, Ρ-approximation algorithm, Relative performance guarantee 
In computer science and operations research, approximation algorithms are algorithms used to find approximate solutions to optimization problems… 
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Discrete optimization problems are everywhere, from traditional operations research planning problems, such as scheduling… 
Highly Cited
2004
Highly Cited
2004
  • J. Tropp
  • IEEE Transactions on Information Theory
  • 2004
  • Corpus ID: 675692
This article presents new results on using a greedy algorithm, orthogonal matching pursuit (OMP), to solve the sparse… 
Highly Cited
2002
Highly Cited
2002
In k-means clustering we are given a set of n data points in d-dimensional space Rd and an integer k, and the problem is to… 
Highly Cited
2002
Highly Cited
2002
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the… 
Highly Cited
1998
Highly Cited
1998
Abstract. The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each… 
Review
1997
Review
1997
Approximation algorithms have developed in response to the impossibility of solving a great variety of important optimization… 
Highly Cited
1997
Highly Cited
1997
Applications and issues application to learning, state dependent noise and queueing applications to signal processing and… 
Highly Cited
1996
Highly Cited
1996
This is the first book to fully address the study of approximation algorithms as a tool for coping with intractable problems… 
Highly Cited
1995
Highly Cited
1995
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2-satisfiability (MAX 2SAT) problems… 
Highly Cited
1983
Highly Cited
1983
  • B. Baker
  • 24th Annual Symposium on Foundations of Computer…
  • 1983
  • Corpus ID: 9706753
This paper describes a general technique that can be used to obtain approximation algorithms for various NP-complete problems on…