Keyword

approximation ratio

Description: A measure in approximation algorithms comparing the value of an algorithm’s solution with the value of an optimal solution.

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

OpenAlex ID: keywords/approximation-ratio

A Greedy Heuristic for the Set-Covering Problem

1979 · V. Chvatal · Mathematics of Operations Research · 2,586

A Quantum Approximate Optimization Algorithm

2014 · Farhi, Edward, Goldstone, Jeffrey, et al. · arXiv (Cornell University) · 1,792

PDF

Clustering to minimize the maximum intercluster distance

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

PDF

A fast algorithm for Steiner trees

1981 · L. Kou, G. Markowsky, et al. · Acta Informatica · 1,193

Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem

2022 · Nicos Christofides · Operations Research Forum · 1,131

PDF

On the ratio of optimal integral and fractional covers

1975 · L. Lovász · Discrete Mathematics · 1,115

Optimization Approaches for the Traveling Salesman Problem with Drone

2018 · Niels Agatz, Paul Bouman, et al. · Transportation Science · 1,033

PDF

The budgeted maximum coverage problem

1999 · Samir Khuller, Anna Moss, et al. · Information Processing Letters · 983

Approximation Algorithms

2003 · Vijay V. Vazirani · Springer eBooks · 909

Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors

1977 · Oscar H. Ibarra, Chul E. Kim · Journal of the ACM · 798

PDF

An Application of Bin-Packing to Multiprocessor Scheduling

1978 · E. G. Coffman, Jr., M. R. Garey, et al. · SIAM Journal on Computing · 660

Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks

2004 · Peng-Jun Wan, Khaled M. Alzoubi, et al. · Mobile Networks and Applications · 657

Distributed construction of connected dominating set in wireless ad hoc networks

2003 · Peng-Jun Wan, K.M. Alzoubi, et al. · Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM) · 628

The Dense k -Subgraph Problem

2001 · U. Feige, D. Peleg, et al. · Algorithmica · 592

Approximation Algorithms

2000 · Bernhard Korte, Jens Vygen · Algorithms and combinatorics · 579

Quantum approximate optimization of non-planar graph problems on a planar superconducting processor

2021 · Matthew P. Harrigan, Kevin J. Sung, et al. · Nature Physics · 556

PDF

Improved Steiner tree approximation in graphs

2000 · Gabriel Robins, Alex Zelikovsky · 529

Approximation Algorithms for the Set Covering and Vertex Cover Problems

1982 · Dorit S. Hochbaum · SIAM Journal on Computing · 507

An analysis of the greedy algorithm for the submodular set covering problem

1982 · L. A. Wolsey · COMBINATORICA · 501

Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP

2003 · Kamal Jain, Mohammad Mahdian, et al. · Journal of the ACM · 481

PDF

A local search approximation algorithm for k-means clustering

2002 · Tapas Kanungo, David M. Mount, et al. · 476

Polynomial time approximation schemes for Euclidean TSP and other geometric problems

2002 · S. Arora · 449

Approximation Algorithms for Bin-Packing — An Updated Survey

1984 · E. G. Coffman, M. R. Garey, et al. · Courses and lectures · 433

A linear-time approximation algorithm for the weighted vertex cover problem

1981 · R Bar-Yehuda, S Even · Journal of Algorithms · 430

Greedy Strikes Back: Improved Facility Location Algorithms

1999 · Sudipto Guha, Samir Khuller · Journal of Algorithms · 427

Works count: 7,549

Citation count: 124,400