A simple on-line bin-packing algorithm
Journal of the ACM (JACM)
On-line routing of virtual circuits with applications to load balancing and machine scheduling
Journal of the ACM (JACM)
An optimal deterministic algorithm for online b-matching
Theoretical Computer Science
Journal of the ACM (JACM)
Online learning in online auctions
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
Dependent Rounding in Bipartite Graphs
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Online Scheduling for Sorting Buffers
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
SIAM Journal on Computing
On conflict-free coloring of points and simple regions in the plane
Proceedings of the nineteenth annual symposium on Computational geometry
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A scheduling model for reduced CPU energy
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Adaptive limited-supply online auctions
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
On the performance of greedy algorithms in packet buffering
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Dynamic Speed Scaling to Manage Energy and Temperature
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
The Price of Routing Unsplittable Flow
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The price of anarchy of finite congestion games
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Online client-server load balancing without global information
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating the average response time in broadcast scheduling
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Online convex optimization in the bandit setting: gradient descent without a gradient
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Online conflict-free coloring for intervals
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A multiple-choice secretary algorithm with applications to online auctions
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The relative worst order ratio applied to paging
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Oblivious routing on node-capacitated and directed graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Distributed online call control on general networks
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
An optimal online algorithm for packet scheduling with agreeable deadlines
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Online ascending auctions for gradually expiring items
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
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
Selfish routing with atomic players
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Selfish Routing and the Price of Anarchy
Selfish Routing and the Price of Anarchy
On the Performance of Greedy Algorithms in Packet Buffering
SIAM Journal on Computing
AdWords and Generalized On-line Matching
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Online interval coloring and variants
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Dynamic bin packing of unit fractions items
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Reordering buffer management for non-uniform cost models
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Online routing in faulty meshes with sub-linear comparative time and traffic ratio
ESA'05 Proceedings of the 13th annual European conference on Algorithms
On the price of anarchy and stability of correlated equilibria of linear congestion games,,
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Packet routing and information gathering in lines, rings and trees
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Online bin packing with cardinality constraints
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Online view maintenance under a response-time constraint
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Online primal-dual algorithms for covering and packing problems
ESA'05 Proceedings of the 13th annual European conference on Algorithms
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Semi-online problems on identical machines with inexact partial information
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
On-line simultaneous maximization of the size and the weight for degradable intervals schedules
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
On-line algorithms for market equilibria
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
The reverse greedy algorithm for the metric K-median problem
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
On the power of lookahead in on-line vehicle routing problems
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Preemptive semi-online scheduling on parallel machines with inexact partial information
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
On-line computation and maximum-weighted hereditary subgraph problems
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Page migration in dynamic networks
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Online interval coloring with packing constraints
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Packet buffering: randomization beats deterministic algorithms
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Improved algorithms for dynamic page migration
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Speed scaling to manage temperature
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Approximating the online set multicover problems via randomized winnowing
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
The on-line asymmetric traveling salesman problem
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
On the vehicle routing problem
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
The maximum resource bin packing problem
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
A lower bound for on-line scheduling on uniformly related machines
Operations Research Letters
An optimal algorithm for preemptive on-line scheduling
Operations Research Letters
Hi-index | 0.00 |
This quarter's column contains a survey of work on online algorithms from last year. It covers papers from the following conferences: SODA, STACS, STOC, ICALP, ESA, WADS, COCOON, ISAAC, FCT, FOCS and MFCS. The bibliography of online algorithms (see www.cs.ucr.edu/~marek/pubs/online.bib) has been updated, and it now contains all the papers discussed in this survey -- and more.