Ausgabe 4/2020
Special Issue on Approximation and Online Algorithms 2018
Inhalt (7 Artikel)
Correction
Correction to: Special Issue on Approximation and Online Algorithms
Leah Epstein, Thomas Erlebach
Open Access
Approximating Node-Weighted k-MST on Planar Graphs
Jarosław Byrka, Mateusz Lewandowski, Joachim Spoerhase
An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals
Minjun Chang, Dorit S. Hochbaum, Quico Spaen, Mark Velednitsky