Skip to main content

Theory of Computing Systems

Ausgabe 4/2020

Special Issue on Approximation and Online Algorithms 2018

Inhalt (7 Artikel)

Deterministic Min-Cost Matching with Delays

Yossi Azar, Amit Jacob Fanani

Advice Complexity of Priority Algorithms

Allan Borodin, Joan Boyar, Kim S. Larsen, Denis Pankratov

Open Access

Approximating Node-Weighted k-MST on Planar Graphs

Jarosław Byrka, Mateusz Lewandowski, Joachim Spoerhase

Premium Partner