Keyword

constant-factor approximation

Description: An approximation algorithm with a worst-case solution quality bounded by a fixed multiplicative factor of the optimum.
OpenAlex ID: keywords/constant-factor-approximation
2007 · Subhash Khot, Oded Regev · Journal of Computer and System Sciences · 948
1999 · Sudipto Guha, Samir Khuller · Journal of Algorithms · 770
2003 · Ronald Fagin, Ravi Kumar, et al. · SIAM Journal on Discrete Mathematics · 745
2002 · Moses Charikar, Sudipto Guha, et al. · Journal of Computer and System Sciences · 591
1997 · Leslie A. Hall, Andreas S. Schulz, et al. · Mathematics of Operations Research · 559
2000 · Madhukar R. Korupolu, C.Greg Plaxton, et al. · Journal of Algorithms · 482
2001 · Amotz Bar-Noy, Reuven Bar-Yehuda, et al. · Journal of the ACM · 454
2004 · A.A. Ageev, M.I. Sviridenko · Journal of Combinatorial Optimization · 451
2002 · Khaled M. Alzoubi, Peng-Jun Wan, et al. · ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) · 444
1986 · Dorit S. Hochbaum, David B. Shmoys · Journal of the ACM · 426
2004 · Ron Shamir, Roded Sharan, et al. · Discrete Applied Mathematics · 421
1994 · Esther M. Arkin, Refael Hassin · Discrete Applied Mathematics · 398
1994 · Avrim Blum, Prasad Chalasani, et al. · ACM Symposium on Theory of Computing (STOC) · 381
1999 · Moses Charikar, Sudipto Guha, et al. · ACM Symposium on Theory of Computing (STOC) · 376
2007 · Shuchi Chawla, Jason D. Hartline, et al. · ACM Conference on Electronic Commerce (EC) · 339
1993 · Daniel Bienstock, Michel X. Goemans, et al. · Mathematical Programming · 334
1993 · Dimitris J. Bertsimas, Garrett van Ryzin · Operations Research · 314
2016 · Hans L. Bodlaender, Pål Grǿnås Drange, et al. · SIAM Journal on Computing · 308
2009 · Jon Lee, Vahab S. Mirrokni, et al. · ACM Symposium on Theory of Computing (STOC) · 296
2014 · Christos Boutsidis, Anastasios Zouzias, et al. · IEEE Transactions on Information Theory · 265
2018 · Ting He, Hana Khamfroush, et al. · IEEE International Conference on Distributed Computing Systems (ICDCS) · 256
2004 · Nikhil Bansal, Avrim Blum, et al. · ACM Symposium on Theory of Computing (STOC) · 256
2006 · Shuchi Chawla, Robert Krauthgamer, et al. · Computational Complexity · 253
2006 · Kenneth L. Clarkson, Kasturi Varadarajan · Discrete & Computational Geometry · 240
Works count: 1,564
Citation count: 40,770
Year
Topic
Type