An optimal algorithm for on-line bipartite matching
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Journal of Algorithms
On-line algorithms for weighted bipartite matching and stable marriages
Theoretical Computer Science
The weighted majority algorithm
Information and Computation
On-line scheduling of jobs with fixed start and end times
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Graph minors. XIII: the disjoint paths problem
Journal of Combinatorial Theory Series B
SIAM Journal on Control and Optimization
A better lower bound on the competitive ratio of the randomized 2-server problem
Information Processing Letters
Online computation and competitive analysis
Online computation and competitive analysis
Linear programs for randomized on-line algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Competitive analysis of randomized paging algorithms
Theoretical Computer Science
Distributed online frequency assignment in cellular networks
Journal of Algorithms
Speed is as powerful as clairvoyance
Journal of the ACM (JACM)
Competitive queueing policies for QoS switches
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Dynamic routing on networks with fixed-size buffers
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Minimizing Congestion in General Networks
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Removable Online Knapsack Problems
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
SIAM Journal on Computing
A tight bound on approximating arbitrary metrics by tree metrics
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A princess swimming in the fog looking for a monster cow
ACM SIGACT News
An Improved Randomized On-Line Algorithm for a Weighted Interval Selection Problem
Journal of Scheduling
On the performance of greedy algorithms in packet buffering
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Incremental Clustering and Dynamic Information Retrieval
SIAM Journal on Computing
On paging with locality of reference
Journal of Computer and System Sciences
Algorithmic problems in power management
ACM SIGACT News
Oblivious routing on node-capacitated and directed graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On profit-maximizing envy-free pricing
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A maiden analysis of longest wait first
ACM Transactions on Algorithms (TALG)
AdWords and Generalized On-line Matching
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Randomized online algorithms for minimum metric bipartite matching
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A general approach for incremental approximation and hierarchical clustering
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Efficient algorithms for online decision problems
Journal of Computer and System Sciences - Special issue: Learning theory 2003
Incremental algorithms for facility location and k-Median
Theoretical Computer Science - Approximation and online algorithms
Weakening the online adversary just enough to get optimal conflict-free colorings for intervals
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Online frequency allocation in cellular networks
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Speed scaling on parallel processors
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Rate vs. buffer size: greedy information gathering on the line
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Online collaborative filtering with nearly optimal dynamic regret
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
A tight bound on online buffer management for two-port shared-memory switches
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Playing games with approximation algorithms
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Reordering buffers for general metric spaces
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Improved bounds for the symmetric rendezvous value on the line
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Better online buffer management
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Considering suppressed packets improves buffer management in QoS switches
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On the separation and equivalence of paging strategies
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Pull-based data broadcast with dependencies: be fair to users, not to items
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Matroids, secretary problems, and online mechanisms
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Online vertex colorings of random graphs without monochromatic subgraphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Dynamic pricing for impatient bidders
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Energy efficient online deadline scheduling
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Speed scaling for weighted flow time
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Path-independent load balancing with unreliable machines
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Semi-oblivious routing: lower bounds
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Energy-efficient algorithms for flow time minimization
ACM Transactions on Algorithms (TALG)
On-line scheduling of parallel jobs in a list
Journal of Scheduling
Finding Disjoint Paths in Expanders Deterministically and Online
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
A Primal-Dual Randomized Algorithm for Weighted Paging
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
A Knapsack Secretary Problem with Applications
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Optimal Resource Augmentations for Online Knapsack
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Improved online algorithms for the sorting buffer problem
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Online primal-dual algorithms for maximizing ad-auctions revenue
ESA'07 Proceedings of the 15th annual European conference on Algorithms
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Online scheduling of equal-length jobs on parallel machines
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Improved upper bounds on the competitive ratio for online realtime scheduling
ESA'07 Proceedings of the 15th annual European conference on Algorithms
An O(log2k)-competitive algorithm for metric bipartite matching
ESA'07 Proceedings of the 15th annual European conference on Algorithms
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Non-clairvoyant batch sets scheduling: fairness is fair enough
ESA'07 Proceedings of the 15th annual European conference on Algorithms
An experimental study of new and known online packet buffering algorithms
ESA'07 Proceedings of the 15th annual European conference on Algorithms
A constant-competitive algorithm for online OVSF code assignment
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Energy efficient deadline scheduling in two processor systems
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
On the relative dominance of paging algorithms
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Online algorithm for parallel job scheduling and strip packing
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
On the online unit clustering problem
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Better bounds for incremental medians
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
A randomized algorithm for two servers in cross polytope spaces
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Online sorting buffers on line
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Packet buffering: randomization beats deterministic algorithms
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
A randomized algorithm for online unit clustering
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Oblivious medians via online bidding
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Competitive algorithms for due date scheduling
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Online conflict-free colorings for hypergraphs
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Online interval scheduling: randomized and multiprocessor cases
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
An improved algorithm for online unit clustering
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
A 1-local 13/9-competitive algorithm for multicoloring hexagonal graphs
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
A survey of buffer management policies for packet switches
ACM SIGACT News
| Hi-index | 0.00 |
This is a survey of last year's work on online competitive algorithms. The survey covers only conference papers, including those from SODA, FOCS, STOC, STACS, COCOON, ISAAC, ESA, ICALP, WAOA, and ISAAC. I tried to focus on research directly dealing with competitive analysis, and in many cases I had to make judgment calls, whether to include them or not. My initial intent was to cover only some highlights, representative of the current trends in the field, but somehow, over time, it grew to a much longer and comprehensive document. I feel compelled to add that, with the deadline approaching, I was not able to spend as much time on debugging as I should, and some errors and omissions are, I'm afraid, inevitable. If you spot anything that should be corrected, please let me know.