Special Issue on Approximation and Online Algorithms 2018
ISSN:
1432-4350 (Print)
1433-0490 (Online)
In this topical collection (5 articles)
-
EditorialNotes
Special Issue on Approximation and Online Algorithms
Leah Epstein, Thomas Erlebach Pages 569-570 -
OriginalPaper
Deterministic Min-Cost Matching with Delays
Yossi Azar, Amit Jacob Fanani Pages 572-592 -
OriginalPaper
Advice Complexity of Priority Algorithms
Allan Borodin, Joan Boyar, Kim S. Larsen, Denis Pankratov Pages 593-625 -
OriginalPaper
Longest Increasing Subsequence under Persistent Comparison Errors
Barbara Geissmann Pages 662-680
Continue reading...
To view the rest of this content please follow the download PDF link above.