Volume 63, Issue 8

November 2019

Special Issue on Approximation and Online Algorithms

Issue Editors:

5 articles in this issue

Guest Editorial: Special Issue on Approximation and Online Algorithms
Roberto Solis-Oba
Rudolf Fleischer
EditorialNotes 26 October 2019 Pages: 1755 - 1756
Part of 2 collections:

Special Issue on Approximation and Online Algorithms (2017)

Approximation and Online Algorithms (WAOA 2017)
Lower Bounds for Several Online Variants of Bin Packing
János Balogh
József Békési
Asaf Levin
OriginalPaper 09 March 2019 Pages: 1757 - 1780
Part of 2 collections:

Special Issue on Approximation and Online Algorithms (2017)

Approximation and Online Algorithms (WAOA 2017)
On Conceptually Simple Algorithms for Variants of Online Bipartite Matching
Allan Borodin
Denis Pankratov
Amirali Salehi-Abari
OriginalPaper 23 March 2019 Pages: 1781 - 1818
Part of 2 collections:

Special Issue on Approximation and Online Algorithms (2017)

Approximation and Online Algorithms (WAOA 2017)
On-line Search in Two-Dimensional Environment
Dariusz Dereniowski
Dorota Osula
OriginalPaper Open access 11 September 2019 Pages: 1819 - 1848
Part of 2 collections:

Special Issue on Approximation and Online Algorithms (2017)

Approximation and Online Algorithms (WAOA 2017)
Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs
Itay Laish
Shay Mozes
OriginalPaper 11 September 2019 Pages: 1849 - 1874
Part of 2 collections:

Special Issue on Approximation and Online Algorithms (2017)

Approximation and Online Algorithms (WAOA 2017)

Search