Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,776,169 papers from all fields of science
Search
Sign In
Create Free Account
Approximation algorithm
Known as:
Absolute performance guarantee
, Ρ-approximation algorithm
, Relative performance guarantee
Expand
In computer science and operations research, approximation algorithms are algorithms used to find approximate solutions to optimization problems…
Expand
Wikipedia
Create Alert
Alert
Related topics
Related topics
50 relations
APX
Angelika Steger
Approximate max-flow min-cut theorem
Approximation-preserving reduction
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
The Design of Approximation Algorithms
David P. Williamson
,
D. Shmoys
2011
Corpus ID: 10574901
Discrete optimization problems are everywhere, from traditional operations research planning problems, such as scheduling…
Expand
Highly Cited
2004
Highly Cited
2004
Greed is good: algorithmic results for sparse approximation
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…
Expand
Highly Cited
2002
Highly Cited
2002
A local search approximation algorithm for k-means clustering
T. Kanungo
,
D. Mount
,
N. Netanyahu
,
C. Piatko
,
R. Silverman
,
A. Wu
SCG '02
2002
Corpus ID: 1044133
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…
Expand
Highly Cited
2002
Highly Cited
2002
A Constant-Factor Approximation Algorithm for the k-Median Problem
M. Charikar
,
S. Guha
,
É. Tardos
,
D. Shmoys
J. Comput. Syst. Sci.
2002
Corpus ID: 10836574
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the…
Expand
Highly Cited
1998
Highly Cited
1998
Approximation Algorithms for Connected Dominating Sets
S. Guha
,
S. Khuller
Algorithmica
1998
Corpus ID: 1249122
Abstract. The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each…
Expand
Review
1997
Review
1997
Approximation Algorithms for NP-Hard Problems
Dorit S. Hochba
SIGA
1997
Corpus ID: 33683322
Approximation algorithms have developed in response to the impossibility of solving a great variety of important optimization…
Expand
Highly Cited
1997
Highly Cited
1997
Stochastic Approximation Algorithms and Applications
H. Kushner
,
G. Yin
Applications of Mathematics
1997
Corpus ID: 125672439
Applications and issues application to learning, state dependent noise and queueing applications to signal processing and…
Expand
Highly Cited
1996
Highly Cited
1996
Approximation Algorithms for NP-Hard Problems
D. Hochbaum
1996
Corpus ID: 61318239
This is the first book to fully address the study of approximation algorithms as a tool for coping with intractable problems…
Expand
Highly Cited
1995
Highly Cited
1995
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
M. Goemans
,
David P. Williamson
JACM
1995
Corpus ID: 15794408
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2-satisfiability (MAX 2SAT) problems…
Expand
Highly Cited
1983
Highly Cited
1983
Approximation algorithms for NP-complete problems on planar graphs
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…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE