An edition of Approximation and Online Algorithms
(2013)
Approximation and Online Algorithms
10th International Workshop, WAOA 2012, Ljubljana, Slovenia, September 13-14, 2012, Revised Selected Papers
by Thomas Erlebach
Share
×Close
This book constitutes the thoroughly refereed post workshop proceedings of the 10th International Workshop on Approximation and Online Algorithms, WAOA 2012, held in Ljubljana, Slovenia, in September 2012 as part of the ALGO 2012 conference event.The 22 revised full papers presented together with invited talk were carefully reviewed and selected from 60 submissions. The workshop covered areas such as geometric problems, online algorithms, scheduling, algorithmic game theory, and approximation algorithms.
Publish Date
2013
Publisher
Springer Berlin Heidelberg,
Imprint: Springer
Language
English
Pages
299
Check nearby libraries
Buy this book
Previews available in: English
Subjects
Computational complexity, Computer graphics, Discrete Mathematics in Computer Science, Electronic data processing, Algorithm Analysis and Problem Complexity, Algorithms, Computer science, Information Systems Applications (incl. Internet), Numeric Computing, Computer software, Approximation theory, Computer algorithms| Edition | Availability |
|---|---|
1
Approximation and Online Algorithms: 16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers
Nov 29, 2018, Springer
paperback
3030046923 9783030046927
|
zzzz
|
2
Approximation and Online Algorithms: 10th International Workshop, WAOA 2012, Ljubljana, Slovenia, September 13-14, 2012, Revised Selected Papers
2013, Springer Berlin Heidelberg, Imprint: Springer
electronic resource :
in English
3642380166 9783642380167
|
aaaa
|
3
Approximation and Online Algorithms: 10th International Workshop, WAOA 2012, Ljubljana, Slovenia, September 13-14, 2012, Revised Selected Papers
Apr 30, 2013, Springer
paperback
3642380174 9783642380174
|
zzzz
|
Book Details
Table of Contents
Invited Contribution
The Primal-Dual Approach for Online Algorithms
Session 1: Graphs and Networks
Independent Set with Advice: The Impact of Graph Knowledge
Online Multi-Commodity Flow with High Demands
Approximating Spanning Trees with Few Branches
On the Complexity of the Regenerator Location Problem – Treewidth and Other Parameters
Session 2: Geometric Problems
Online Exploration of Polygons with Holes
Probabilistic k-Median Clustering in Data Streams
Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs
On Minimum-and Maximum-Weight Minimum Spanning Trees with Neighborhoods
Session 3: Online Algorithms
Asymptotically Optimal Online Page Migration on Three Points
R–LINE: A Better Randomized 2-Server Algorithm on the Line
Black and White Bin Packing
Minimizing Cache Usage in Paging
Session 4: Scheduling.Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems
Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling
Approximating the Throughput by Coolest First Scheduling
Algorithms for Cost-Aware Scheduling
Session 5: Algorithmic Game Theory
A Unifying Tool for Bounding the Quality of Non-cooperative Solutions in Weighted Congestion Games
Some Anomalies of Farsighted Strategic Behavior
Session 6: Approximation Algorithms Scheduling with an Orthogonal Resource Constraint
Improved Approximation Guarantees for Lower-Bounded Facility Location
A 4-Approximation for the Height of Drawing 2-Connected Outer-Planar Graphs
Approximation Algorithms for the Wafer to Wafer Integration Problem.
Edition Notes
Classifications
The Physical Object
Edition Identifiers
Work Identifiers
Community Reviews (0)
| October 7, 2021 | Edited by ImportBot | import existing book |
| June 28, 2019 | Created by MARC Bot | import new book |