Keyword

constant approximation

Description: An approximation algorithm or bound whose solution quality is within a fixed multiplicative factor of the optimum, independent of problem size.
OpenAlex ID: keywords/constant-approximation
1973 · P. H. Rutherford · The Physics of Fluids · 1,153
2001 · A. Meyerson · Annual Symposium on Foundations of Computer Science · 362
2002 · S. Guha, A. Meyerson, et al. · Annual Symposium on Foundations of Computer Science · 160
2008 · Retsef Levi, Robin Roundy, et al. · Management Science · 120
2004 · Mirjam Wattenhofer, Roger Wattenhofer · Lecture notes in computer science · 112
2023 · Mingtao Zhang, Shinichi Nishizawa, et al. · IEEE Transactions on Circuits & Systems II Express Briefs · 98
2016 · Stratis Ioannidis, Edmund Yeh · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) · 78
2004 · Vincenzo Auletta, Roberto De Prisco, et al. · Lecture notes in computer science · 68
2014 · Shi Li · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 66
2016 · Stratis Ioannidis, Edmund Yeh · ACM SIGMETRICS Performance Evaluation Review · 64
2015 · Gregory J. Puleo, Olgica Milenkovic · SIAM Journal on Optimization · 61
2013 · Olga Goussevskaia, Magnús M. Halldórsson, et al. · IEEE/ACM Transactions on Networking · 61
2011 · Hongwei Du, Qiang Ye, et al. · IEEE Conference on Computer Communications (INFOCOM) · 61
2017 · Shi Li · ACM Transactions on Algorithms · 59
2005 · Ding-Zhu Du, My T. Thai, et al. · Lecture notes in computer science · 52
2012 · Kai Han, Liu Xiang, et al. · ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) · 51
2008 · David Shmoys, Kunal Talwar · Springer eBooks · 45
2019 · Bandyapadhyay, Sayan, Inamdar, Tanmay, et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 44
2020 · Choo, Davin, Grunau, Christoph, et al. · arXiv (Cornell University) · 42
2014 · Erik D. Demaine, Piotr Indyk, et al. · Lecture notes in computer science · 42
2008 · Retsef Levi, Andrea Lodi, et al. · Mathematics of Operations Research · 41
1994 · M. J. Schulte, J. Omar, et al. · Computing · 41
2021 · Sayan Bandyapadhyay, Fedor V. Fomin, et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 39
2019 · Yijia Chen, Bingkai Lin · SIAM Journal on Computing · 39
2005 · Retsef Levi, R. Roundy, et al. · Symposium on Discrete Algorithms · 35
Works count: 154
Citation count: 3,834
Year
Topic
Type