default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID10. WAOA 2012: Ljubljana, Slovenia
- Thomas Erlebach, Giuseppe Persiano:
Approximation and Online Algorithms - 10th International Workshop, WAOA 2012, Ljubljana, Slovenia, September 13-14, 2012, Revised Selected Papers. Lecture Notes in Computer Science 7846, Springer 2013, ISBN 978-3-642-38015-0
Invited Contribution
- Nikhil Bansal:
The Primal-Dual Approach for Online Algorithms. 1
Session 1: Graphs and Networks
- Stefan Dobrev, Rastislav Královic
, Richard Královic:
Independent Set with Advice: The Impact of Graph Knowledge - (Extended Abstract). 2-15 - Guy Even, Moti Medina:
Online Multi-Commodity Flow with High Demands. 16-29 - Markus Chimani, Joachim Spoerhase:
Approximating Spanning Trees with Few Branches. 30-41 - Itamar Hartstein, Mordechai Shalom, Shmuel Zaks:
On the Complexity of the Regenerator Location Problem - Treewidth and Other Parameters - (Extended Abstract). 42-55
Session 2: Geometric Problems
- Robert Georges, Frank Hoffmann, Klaus Kriegel:
Online Exploration of Polygons with Holes. 56-69 - Christiane Lammersen, Melanie Schmidt, Christian Sohler:
Probabilistic k-Median Clustering in Data Streams. 70-81 - Guilherme Dias da Fonseca, Celina M. H. de Figueiredo, Vinícius G. P. de Sá, Raphael Machado:
Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs. 82-92 - Reza Dorrigiv, Robert Fraser, Meng He, Shahin Kamali, Akitoshi Kawamura, Alejandro López-Ortiz, Diego Seco:
On Minimum-and Maximum-Weight Minimum Spanning Trees with Neighborhoods. 93-106
Session 3: Online Algorithms
- Akira Matsubayashi:
Asymptotically Optimal Online Page Migration on Three Points. 107-119 - Lucas Bang, Wolfgang W. Bein, Lawrence L. Larmore:
R-LINE: A Better Randomized 2-Server Algorithm on the Line. 120-130 - János Balogh, József Békési, György Dósa, Hans Kellerer, Zsolt Tuza:
Black and White Bin Packing. 131-144 - Alejandro López-Ortiz, Alejandro Salinger:
Minimizing Cache Usage in Paging. 145-158
Session 4: Scheduling
- Adam Kurpisz, Monaldo Mastrolilli, Georgios Stamoulis:
Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems. 159-172 - Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs:
Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling. 173-186 - Christoph Dürr, Ioannis Milis, Julien Robert, Georgios Zois:
Approximating the Throughput by Coolest First Scheduling. 187-200 - Janardhan Kulkarni, Kamesh Munagala:
Algorithms for Cost-Aware Scheduling. 201-214
Session 5: Algorithmic Game Theory
- Vittorio Bilò:
A Unifying Tool for Bounding the Quality of Non-cooperative Solutions in Weighted Congestion Games. 215-228 - Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
Some Anomalies of Farsighted Strategic Behavior. 229-241
Session 6: Approximation Algorithms
- Martin Niemeier, Andreas Wiese:
Scheduling with an Orthogonal Resource Constraint. 242-256 - Sara Ahmadian, Chaitanya Swamy:
Improved Approximation Guarantees for Lower-Bounded Facility Location. 257-271 - Therese Biedl:
A 4-Approximation for the Height of Drawing 2-Connected Outer-Planar Graphs. 272-285 - Trivikram Dokka, Marin Bougeret, Vincent Boudet, Rodolphe Giroudeau, Frits C. R. Spieksma:
Approximation Algorithms for the Wafer to Wafer Integration Problem. 286-297
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-31 20:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
