2005: an offline persepctive
Abstract
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.
References
[1]
Gagan Aggarwal, Amos Fiat, Andrew V. Goldberg, Jason D. Hartline, Nicole Immorlica, and Madhu Sudan. Derandomization of auctions. In Proc. 37th Symp. Theory of Computing (STOC), pages 619--625, 2005.
[2]
Susanne Albers and Markus Schmidt. On the performance of greedy algorithms in packet buffering. In Proc. 36th Symp. Theory of Computing (STOC), pages 35--44. ACM, 2004.
[3]
Susanne Albers and Markus Schmidt. On the performance of greedy algorithms in packet buffering. SIAM J. Comput., 35(2):278--304, 2005.
[4]
Luca Allulli, Giorgio Ausiello, and Luigi Laura. On the power of lookahead in on-line vehicle routing problems. In Proc. 11th Annual International Computing and Combinatorics Conference (COCOON), pages 728--736, 2005.
[5]
Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, and Joseph Naor. The online set cover problem. In Proc. 35th Symp. Theory of Computing (STOC), pages 100--105, 2003.
[6]
Spyros Angelopoulos, Atish Das Sarma, Avner Magen, and Anastasios Viglas. On-line algorithms for market equilibria. In Proc. 11th Annual International Computing and Combinatorics Conference (COCOON), pages 596--607, 2005.
[7]
K. Arrow and G. Debreu. Existence of an equilibrium for a competitive economy. Econometrica, 22:265--290, 1954.
[8]
James Aspnes, Yossi Azar, Amos Fiat, Serge Plotkin, and Orli Waarts. On-line load balancing with applications to machine scheduling and virtual circuit routing: J. ACM, 44:486--504, 1997.
[9]
Giorgio Ausiello, Vincenzo Bonifaci, and Luigi Laura. The on-line asymmetric traveling salesman problem. In Proc. 9th Workshop on Algorithms and Data Structures (WADS), pages 306--317, 2005.
[10]
Baruch Awerbuch, Yossi Azar, and Amir Epstein. The price of routing unsplittable flow. In Proc. 37th Symp. Theory of Computing (STOC), pages 57--66, 2005.
[11]
Baruch Awerbuch, Yossi Azar, and Serge Plotkin. Throughput-competitive online routing. In Proc. 34th Symp. Foundations of Computer Science (FOCS), pages 32--40. IEEE, 1993.
[12]
Baruch Awerbuch, Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, and Tom Leighton. Online client-server load balancing without global information. In Proc. 16th Symp. on Discrete Algorithms (SODA), pages 197--206, 2005.
[13]
Yossi Azar and Rafi Zachut. Packet routing and information gathering in lines, rings and trees. In Proc. 12th European Symp. on Algorithms (ESA), pages 484--495, 2005.
[14]
Fabien Baille, Evripidis Bampis, Christian Laforest, and Nicolas Thibault. On-line simultaneous maximization of the size and the weight for degradable intervals schedules. In Proc. 11th Annual International Computing and Combinatorics Conference (COCOON), pages 308--317, 2005.
[15]
Nikhil Bansal, Moses Charikar, Sanjeev Khanna, and Joseph Naor. Approximating the average response time in broadcast scheduling. In Proc. 16th Symp. on Discrete Algorithms (SODA), pages 215--221, 2005.
[16]
Nikhil Bansal, Tracy Kimbrel, and Kirk Pruhs. Dynamic speed scaling to manage energy and temperature. In Proc. 45th Symp. Foundations of Computer Science (FOCS), pages 520--529. IEEE, 2004.
[17]
Nikhil Bansal and Kirk Pruhs. Speed scaling to manage temperature. In Proc. 23rd Symp. on Theoretical Aspects of Computer Science (STACS), pages 460--471, 2005.
[18]
Wolfgang W. Bein, Kazuo Iwama, Lawrence L. Larmore, and John Noga. The delayed k-server problem. In Proc. 15th International Symp. on Fundamentals of Computation Theory (FCT), pages 281--292, 2005.
[19]
Piotr Berman and Surajit K. Das. On the vehicle routing problem. In Proc. 9th Workshop on Algorithms and Data Structures (WADS), pages 360--371, 2005.
[20]
Piotr Berman and Bhaskar DasGupta. Approximating the online set multicover problems via randomized winnowing. In Proc. 9th Workshop on Algorithms and Data Structures (WADS), pages 110--121, 2005.
[21]
Marcin Bienkowski and Friedhelm Meyer auf der Heide. Page migration in dynamic networks. In Proc. 30th Symp. on Mathematical Foundations of Computer Science (MFCS), pages 1--14, 2005.
[22]
Marcin Bienkowski, Miroslaw Dynia, and Miroslaw Korzeniowski. Improved algorithms for dynamic page migration. In Proc. 23rd Symp. on Theoretical Aspects of Computer Science (STACS), pages 365--376, 2005.
[23]
Avrim Blum and Jason D. Hartline. Near-optimal online auctions. In Proc. 16th Symp. on Discrete Algorithms (SODA), pages 1156--1163, 2005.
[24]
Avrim Blum, Vijay Kumar, Atri Rudra, and Felix Wu. Online learning in online auctions. In Proc. 14th Symp. on Discrete Algorithms (SODA), 2003.
[25]
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, and Sanne Wøhlk. The maximum resource bin packing problem. In Proc. 15th International Symp. on Fundamentals of Computation Theory (FCT), pages 397--408, 2005.
[26]
Joan Boyar, Lene M. Favrholdt, and Kim S. Larsen. The relative worst order ratio applied to paging. In Proc. 16th Symp. on Discrete Algorithms (SODA), pages 718--727, 2005.
[27]
Niv Buchbinder and Joseph Naor. Online primal-dual algorithms for covering and packing problems. In Proc. 12th European Symp. on Algorithms (ESA), pages 689--701, 2005.
[28]
Wun-Tat Chan, Tak-Wah Lam, Kin-Shing Liu, and Prudence W. H. Wong. New resource augmentation analysis of the total stretch of srpt and sjf in multiprocessor scheduling. In Proc. 30th Symp. on Mathematical Foundations of Computer Science (MFCS), pages 236--247, 2005.
[29]
Wun-Tat Chan, Tak Wah Lam, and Prudence W. H. Wong. Dynamic bin packing of unit fractions items. In Proc, 32nd International Colloquium on Automata, Languages, and Programming (ICALP), pages 614--626, 2005.
[30]
Bo Chen, Andre van Vliet, and Gerhard J. Woeginger. An optimal algorithm for preemptive on-line Scheduling. Oper. Res. Lett., 18:127--131, 1995.
[31]
George Christodoulou and Elias Koutsoupias. On the price of anarchy and stability of correlated equilibria of linear congestion games. In Proc. 12th European. Symp. on Algorithms (ESA), pages 59--70, 2005.
[32]
George Christodoulou and Elias Koutsoupias. The price of anarchy of finite congestion games. In Proc. 37th Symp. Theory of Computing (STOC), pages 67--73, 2005.
[33]
Marek Chrobak, Wojciech Jawor, Jiří Sgall, and Tomáš Tichý. Improved online algorithms for buffer management in QoS switches. In Proc. 12th European Symp. on Algorithms (ESA), volume 3221 of Lecture Notes in Comput. Sci., pages 204 215. Springer, 2004.
[34]
Marek Chrobak, Claire Kenyon, and Neal Young. The reverse greedy algorithm for the k-median problem. In Proc. 11th Annual International Computing and Combinatories Conference (COCOON), pages 654--660, 2005.
[35]
Edward G. Coffman, Michael R. Garey, and David S. Johnson. Dynamic bin packing. SIAM J. Comput., 12:227--258, 1983.
[36]
Marc Demange, Bernard Kouakou, and Éric Soutif. On-line computation and maximum-weighted hereditary subgraph problems. In Proc. 16th International Symp. on Algorithms and Computation (ISAAC), pages 433--442, 2005.
[37]
Tomáš Ebenlendr and Jiří Sgall. Optimal and online preemptive scheduling on uniformly related machines. In Proc. 21st Symp. on Theoretical Aspects of Computer Science (STACS), volume 2996 of Lecture Notes in Comput. Sci., pages 199--210. Springer, 2004.
[38]
Matthias Englert and Matthias Westerman. Reordering buffer management for non-uniform cost models. In Proc. 32nd International Colloquium on Automata, Languages, and Programming (ICALP), pages 627--638, 2005.
[39]
Leah Epstein. Online bin packing with cardinality constraints. In Proc. 12th European Symp. on Algorithms (ESA), pages 604--615, 2005.
[40]
Leah Epstein and Meital Levy. Online interval coloring and variants. In Proc. 32nd International Colloquium on Automata, Languages, and Programming (ICALP), pages 602--613, 2005.
[41]
Leah Epstein and Meital Levy. Online interval coloring with packing constraints. In Proc. 30th Symp. on Mathematical Foundations of Computer Science (MFCS), pages 295 307, 2005.
[42]
Leah Epstein and Jiří Sgall. A lower bound for on-line scheduling on uniformly related machines. Oper. Res. Lett., 26(1):17--22, 2000.
[43]
Amos Fiat, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, and Emo Welzl. Online conflict-free coloring for intervals. In Proc. 16th Symp. on Discrete Algorithms (SODA), pages 545--554, 2005.
[44]
Abraham Flaxman, Adam Tauman Kalai, and H. Brendan McMahan. Online convex optimization in the bandit setting: gradient descent without a gradient. In Proc. 16th Symp. on Discrete Algorithms (SODA), pages 385--394, 2005.
[45]
Gereon Frahling and Jens Krokowski. Online occlusion culling. In Proc. 12th European Symp. on Algorithms (ESA), pages 758--769, 2005.
[46]
Rajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy, and Aravind Srinivasan. Dependent rounding in bipartite graphs. In Proc. 43rd Symp. Foundations of Computer Science (FOCS), pages 323--332, 2002.
[47]
Venkatesan Guruswami, Jason D. Hartline, Anna R. Karlin, David Kempe, Claire Kenyon, and Frank McSherry. On profit-maximizing envy-free pricing. In Proc. 16th Symp. on Discrete Algorithms (SODA), pages 1164--1173, 2005.
[48]
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton, and Harald Räcke. Oblivious routing on node-capacitated and directed graphs. In Proc. 16th Symp. on Discrete Algorithms (SODA), pages 782--790, 2005.
[49]
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, and David C. Parkes. Adaptive limited-supply online auctions. In Proc. ACM Conference on Electronic Commerce (EC), pages 71--80, 2004.
[50]
S. Har-Peled and S. Smorodinsky. On conflict-free coloring of points and simple regions in the place. In Proc. 19th ACM Symposium on Computational Geometry, pages 114--123, 2003.
[51]
Yong He and Yiwei Jiang. Preemptive semi-online scheduling on parallel machines with inexact partial information. In Proc. 16th International Symp. on Algorithms and Computation (ISAAC), pages 422--432, 2005.
[52]
Sandy Irani. Page replacement with multi-size pages and applications to web caching. Algorithmica, 33(3):384--409, 2002.
[53]
Bala Kalyanasundaram and Kirk Pruhs. An optimal deterministic algorithm for online b-matching. Theoret. Comput. Sci., 233(1--2):319--325, 2000.
[54]
Bala Kalyanasundaram, Kirk R. Pruhs, and Mahe Velauthapillai. Scheduling broadcasts in wireless networks. J. Sched., 4:339--354, 2001.
[55]
Robert D. Kleinberg. A multiple-choice secretary algorithm with applications to online auctions. In Proc. 16th Symp. on Discrete Algorithms (SODA), pages 630--631, 2005.
[56]
Elias Koutsoupias and Christos Papadimitriou. Worst-case equilibria. In Proc. 16th Symp. on Theoretical Aspects of Computer Science (STACS), Lecture Notes in. Comput. Sci., pages 404--413. Springer, 1999.
[57]
Ron Lavi and Noam Nisan. Online ascending auctions for gradually expiring items. In Proc. 16th Symp. on Discrete Algorithms (SODA), pages 1146--1155, 2005.
[58]
C. C. Lee and D. T. Lee. A simple online bin packing algorithm. J. ACM, 32:562--572, 1985.
[59]
Fei Li, Jay Sethuraman, and Clifford Stein. An optimal online algorithm for packet scheduling with agreeable deadlines. In Proc. 16th Symp. on Discrete Algorithms (SODA), pages 801--802, 2005.
[60]
Aranyak Mehta, Amin Saberi, Umesh V. Vazirani, and Vijay V. Vazirani. Adwords and generalized on-line matching. In Proc. 45th Symp. Foundations of Computer Science (FOCS), pages 264--273, 2005.
[61]
Ramgopal R. Mettu and C. Greg Plaxton. The online median problem. SIAM J. Comput., 32:816--832, 2003.
[62]
Adam Meyerson. The parking permit problem. In Proc. 45th Symp. Foundations of Computer Science (FOCS), pages 274--284, 2005.
[63]
Kamesh Munagala, Jun Yang, and Hai Yu. Online view maintenance under a response-time constraint. In Proc. 12th. European Symp. on Algorithms (ESA), pages 677--688, 2005.
[64]
N. S. Narayanaswamy. Dynamic storage allocation and on-line colouring interval graphs. In Proc. 10th Annual International Computing and Combinatorics Conference (COCOON), pages 329--338, 2004.
[65]
H. Racke. Minimizing congestion in general networks. In Proc. 43rd Symp. Foundations of Computer Science (FOCS), pages 43--52, 2002.
[66]
H. Räcke, C. Sohler, and M. Westermann. Online scheduling for sorting buffers. In Proc. 10th European Symp. on Algorithms (ESA), pages 820--832, 2002.
[67]
Harald Räcke and Adi Rosén. Distributed online call control on general networks. In Proc. 16th Symp. on Discrete Algorithms (SODA), pages 791--800, 2005.
[68]
Tim Roughgarden. Selfish routing and the price of anarchy. The MIT Press, 2005.
[69]
Tim Roughgarden. Selfish routing with atomic players. In Proc. 16th Symp. on Discrete Algorithms (SODA), pages 1184--1185, 2005.
[70]
Tim Roughgarden and Éva Tardos. How bad is selfish routing? J. ACM, 49(2):236--259, 2002.
[71]
Stefan Rührup and Christian Schindelhauer. Online routing in faulty meshes with sub-linear comparative time and traffic ratio. In Proc. 12th European Symp. on Algorithms (ESA), pages 23--34, 2005.
[72]
Markus Schmidt. Packet buffering: Randomization beats deterministic algorithms. In Proc. 23rd Symp. on Theoretical Aspects of Computer Science (STACS), pages 293--304, 2005
[73]
Zhiyi Tan and Yong He. Semi-online problems on identical machines with inexact partial information. In Proc. 11th Annual International Computing and Combinatorics Conference (COCOON), pages 297--307, 2005.
[74]
F. Yao, A. Demers, and S. Shenker. A scheduling model for reduced CPU energy. In Proc. 36th Symp. Foundations of Computer Science (FOCS), pages 374--384. IEEE, 1995.
[75]
M. Zinkevich. Online convex programming and generalized infinitesimal gradient ascent. In Proc. 12th Int. Conference on Machine Learning, pages 928--936, 2003.
Index Terms
- 2005: an offline persepctive
Recommendations
Comments
Information & Contributors
Information
Published In
Copyright © 2006 Author.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 March 2006
Published in SIGACT Volume 37, Issue 1
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 455Total Downloads
- Downloads (Last 12 months)3
- Downloads (Last 6 weeks)0
Reflects downloads up to 26 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in