Volume 62, Issue 2

February 2018

Workshop on Approximation and Online Algorithms (WAOA 2015)

Issue Editors:

10 articles in this issue

WAOA 2015 Special Issue on TOCS
Laura Sanità
Martin Skutella
EditorialNotes 08 February 2018 Pages: 247 - 248
Constant-Time Local Computation Algorithms
Yishay Mansour
Boaz Patt-Shamir
Shai Vardi
OriginalPaper 20 June 2017 Pages: 249 - 267
Geometric Hitting Set for Segments of Few Orientations
Sándor P. Fekete
Kan Huang
Cynthia A. Phillips
OriginalPaper 06 February 2017 Pages: 268 - 303
Scheduling Parallel Jobs Online with Convex and Concave Parallelizability
Roozbeh Ebrahimi
Samuel McCauley
Benjamin Moseley
OriginalPaper 09 November 2016 Pages: 304 - 318
Maximum ATSP with Weights Zero and One via Half-Edges
Katarzyna Paluch
OriginalPaper 04 November 2017 Pages: 319 - 336
Shortest Augmenting Paths for Online Matchings on Trees
Bartłomiej Bosek
Dariusz Leniowski
Anna Zych-Pawlewicz
OriginalPaper Open access 24 January 2018 Pages: 337 - 348
Tight Bounds for Double Coverage Against Weak Adversaries
Nikhil Bansal
Marek Eliáš
Kirk Pruhs
OriginalPaper Open access 02 September 2016 Pages: 349 - 365
On the Smoothness of Paging Algorithms
Jan Reineke
Alejandro Salinger
OriginalPaper 13 October 2017 Pages: 366 - 418
Efficient Vertex-Label Distance Oracles for Planar Graphs
Shay Mozes
Eyal E. Skop
OriginalPaper 12 December 2017 Pages: 419 - 440
Approximation Algorithms for Connected Graph Factors of Minimum Weight
Kamiel Cornelissen
Ruben Hoeksma
Marten Waanders
OriginalPaper Open access 16 November 2016 Pages: 441 - 464

Search