Keyword

competitive algorithms

Description: Algorithms evaluated by comparing their performance with an optimal offline solution, especially for online and distributed optimization problems.

Primary topic: Optimization and Search Problems (52%)

OpenAlex ID: keywords/competitive-algorithms

Competitive algorithms for on-line problems

1988 · Mark Manasse, Lyle McGeoch, et al. · 362

Online Choice of Active Learning Algorithms

2003 · Yoram Baram, Ran El‐Yaniv, et al. · 211

The Syntax of Anaphora

2004 · Ken Safir · Oxford University Press eBooks · 200

Microeconomic algorithms for load balancing in distributed computer systems

2003 · D. Ferguson, Y. Yemini, et al. · 180

Optimized network traffic engineering using segment routing

2015 · Randeep Bhatia, Fang Hao, et al. · 177

How to learn an unknown environment. I

1998 · Xiaotie Deng, Tiko Kameda, et al. · Journal of the ACM · 161

PDF

How to learn an unknown environment

2002 · X. Deng, T. Kameda, et al. · 127

Speed Scaling with an Arbitrary Power Function

2009 · Nikhil Bansal, Ho-Leung Chan, et al. · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 110

On-line admission control and circuit routing for high performance computing and communication

2002 · B. Awerbuch, R. Gawlick, et al. · Annual Symposium on Foundations of Computer Science · 100

Universal Piecewise Linear Prediction Via Context Trees

2007 · Suleyman S. Kozat, Andrew C. Singer, et al. · IEEE Transactions on Signal Processing · 91

An Algorithm for Online K-Means Clustering

2015 · Edo Liberty, Ram Sriharsha, et al. · 86

PDF

Oblivious network design

2006 · Anupam Gupta, Mohammad Taghi Hajiaghayi, et al. · 81

Beyond matroids: secretary problem and prophet inequality with general constraints

2016 · Aviad Rubinstein · ACM Symposium on Theory of Computing (STOC) · 79

PDF

Dueling algorithms

2011 · Nicole Immorlica, Adam Tauman Kalai, et al. · ACM Symposium on Theory of Computing (STOC) · 69

Competitive management of distributed shared memory

2003 · D.L. Black, A. Gupta, et al. · 65

Integrated scheduling of unicast and multicast traffic in an input-queued switch

1999 · M. Andrews, S. Khanna, et al. · 62

Competitive On-line Linear Regression

1997 · Vladimir Vovk · neural information processing systems · 59

Oblivious network design

2006 · Anupam Gupta, Mohammad T. Hajiaghayi, et al. · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 56

Distributed Paging for General Networks

1998 · Baruch Awerbuch, Yair Bartal, et al. · Journal of Algorithms · 55

Algorithm performance and problem structure for flow-shop scheduling

1999 · Jean‐Paul Watson, Laura Barbulescu, et al. · 50

Competitive k-server algorithms

2002 · A. Fiat, Y. Rabani, et al. · Annual Symposium on Foundations of Computer Science · 48

Combinatorial Prophet Inequalities

2017 · Aviad Rubinstein, Sahil Singla · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 46

Universal Switching Linear Least Squares Prediction

2007 · S.S. Kozat, A.C. Singer · IEEE Transactions on Signal Processing · 46

Matroid Secretary for Regular and Decomposable Matroids

2013 · Michael Dinitz, Guy Kortsarz · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 41

PDF

Opportunity cost algorithms for reduction of I/O and interprocess communication overhead in a computing cluster

2003 · A. Keren, A. Barak · IEEE Transactions on Parallel and Distributed Systems · 41

Works count: 390

Citation count: 4,598