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 (opens in a new tab)

Related topics

Related topics

50 relations
APXAngelika StegerApproximate max-flow min-cut theoremApproximation-preserving reduction

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
Dependent rounding and its applications to approximation algorithms
We develop a new randomized rounding approach for fractional vectors defined on the edge-sets of bipartite graphs. We show… 
Highly Cited
2005
Highly Cited
2005
Improved Approximation Algorithms for Geometric Set Cover
Given a collection S of subsets of some set ${\Bbb U},$ and ${\Bbb M}\subset{\Bbb U},$ the set cover problem is to find the… 
Highly Cited
2001
Highly Cited
2001
Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation
We present approximation algorithms for the metric uncapacitated facility location problem and the metric <italic>k</italic… 
Highly Cited
1999
Highly Cited
1999
A constant-factor approximation algorithm for the k-median problem (extended abstract)
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the… 
Highly Cited
1999
Highly Cited
1999
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
In this paper, we establish max-flow min-cut theorems for several important classes of multicommodity flow problems. In… 
Highly Cited
1997
Highly Cited
1997
Stochastic Approximation Algorithms and Applications
Applications and issues application to learning, state dependent noise and queueing applications to signal processing and… 
Highly Cited
1997
Highly Cited
1997
Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
In this paper we introduce two general techniques for the design and analysis of approximation algorithms for NP-hard scheduling… 
Highly Cited
1993
Highly Cited
1993
An 11/6-approximation algorithm for the network steiner problem
An instance of the Network Steiner Problem consists of an undirected graph with edge lengths and a subset of vertices; the goal… 
Highly Cited
1991
Highly Cited
1991
Fast approximation algorithms for multicommodity flow problems
All previously known algorithms for solving the multicommodity flow problem with capacities are based on linear programming. The… 
Highly Cited
1986
Highly Cited
1986
A unified approach to approximation algorithms for bottleneck problems
In this paper a powerful, and yet simple, technique for devising approximation algorithms for a wide variety of NP-complete… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)