Get Free Shipping on orders over $89
Approximation and Online Algorithms : 10th International Workshop, Waoa 2012, Ljubljana, Slovenia, September 13-14, 2012, Revised Selected Papers - Thomas Erlebach

Approximation and Online Algorithms

10th International Workshop, Waoa 2012, Ljubljana, Slovenia, September 13-14, 2012, Revised Selected Papers

By: Thomas Erlebach (Editor), Giuseppe Persiano (Editor)

Paperback | 19 April 2013

At a Glance

Paperback


$84.99

or 4 interest-free payments of $21.25 with

 or 

Ships in 5 to 7 business days

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.

More in Information Technology General Issue

Open to Work : How to Get Ahead in the Age of AI - Ryan Roslansky

RRP $34.99

$27.99

20%
OFF
Technology and Beyond : Business Solutions for One World, One Future - Komal Chopra
How to Talk to AI : (And How Not To) - Jamie Bartlett
Doppelganger : A Trip Into the Mirror World - Naomi Klein

RRP $26.99

$22.99

15%
OFF
The Singularity is Nearer : When We Merge with AI - Ray Kurzweil

RRP $26.99

$22.99

15%
OFF
Careless People : A story of where I used to work - Sarah Wynn-Williams

RRP $24.99

$21.75

13%
OFF
Apple : The First 50 Years - David Pogue

RRP $80.00

$56.75

29%
OFF
Man-Made : How the bias of the past is being built into the future - Tracey Spicer