Keyword

approximation algorithms

Description: Algorithms that efficiently produce near-optimal solutions to computational optimization problems when exact solutions are impractical.

Primary topic: Complexity and Algorithms in Graphs (38%)

Wikidata ID: wiki/Q621751

OpenAlex ID: keywords/approximation-algorithms

Combinatorial Optimization: Algorithms and Complexity.

1984 · David S. Johnson, Christos H. Papadimitriou, et al. · American Mathematical Monthly · 5,942

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

1979 · R.L. Graham, E.L. Lawler, et al. · Annals of discrete mathematics · 5,896

An analysis of approximations for maximizing submodular set functions—I

1978 · G. L. Nemhauser, L. A. Wolsey, et al. · Mathematical Programming · 4,402

Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints

1987 · Marius M. Solomon · Operations Research · 4,314

Greed is Good: Algorithmic Results for Sparse Approximation

2004 · J.A. Tropp · IEEE Transactions on Information Theory · 3,636

Approximation Algorithms

2011 · Survivable Network Design · SpringerReference · 3,190

Approximation Algorithms for NP-Hard Problems

1997 · Dorit S. Hochba · ACM SIGACT News · 3,107

PDF

Routing of multipoint connections

1988 · B.M. Waxman · IEEE Journal on Selected Areas in Communications · 2,895

Introduction to the Theory of Computation

1996 · Michael Sipser · ACM SIGACT News · 2,840

DBSCAN Revisited, Revisited

2017 · Erich Schubert, Jörg Sander, et al. · ACM Transactions on Database Systems · 2,745

A Linear-Time Heuristic for Improving Network Partitions

1982 · C.M. Fiduccia, R.M. Mattheyses · Proceedings - ACM IEEE Design Automation Conference · 2,539

Computational Optimal Transport with Applications to Data Sciences

2019 · Gabriel Peyré, Marco Cuturi · Foundations and Trends® in Machine Learning · 2,337

Computational Complexity: A Modern Approach

2009 · Sanjeev Arora, Boaz Barak · 2,300

Approximation algorithms for combinatorial problems

1974 · David S. Johnson · Journal of Computer and System Sciences · 2,211

PDF

Stable recovery of sparse overcomplete representations in the presence of noise

2005 · D.L. Donoho, M. Elad, et al. · IEEE Transactions on Information Theory · 2,183

The computational complexity of probabilistic inference using bayesian belief networks

1990 · Gregory F. Cooper · Artificial Intelligence · 1,940

Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters

2009 · Jure Leskovec, Kevin J. Lang, et al. · Internet Mathematics · 1,873

PDF

Robust discrete optimization and network flows

2003 · Dimitris Bertsimas, Melvyn Sim · Mathematical Programming · 1,802

Clustering to minimize the maximum intercluster distance

1985 · Teofilo F. Gonzalez · Theoretical Computer Science · 1,721

PDF

P-Complete Approximation Problems

1976 · Sartaj Sahni, Teofilo Gonzalez · Journal of the ACM · 1,705

PDF

Optimization, approximation, and complexity classes

1991 · Christos H. Papadimitriou, Mihalis Yannakakis · Journal of Computer and System Sciences · 1,652

The Shifting Bottleneck Procedure for Job Shop Scheduling

1988 · Joseph Adams, Egon Balas, et al. · Management Science · 1,603

Toward optimal feature selection

1996 · Daphne Koller, Mehran Sahami · 1,482

Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies

2008 · Andreas Krause, Ajit Singh, et al. · Journal of Machine Learning Research · 1,362

A Dynamic Programming Approach to Sequencing Problems

1962 · Michael Held, Richard M. Karp · Journal of the Society for Industrial and Applied Mathematics · 1,337

Works count: 45,080

Citation count: 774,400