Correction to: Special Issue on Approximation and Online Algorithms.
- Published in:
- 2020
- By:
- Publication type:
- Correction Notice
Works matching IS 14324350 AND DT 2020 AND VI 64 AND IP 4
Results: 7
1
2
Special Issue on Approximation and Online Algorithms.
- Published in:
- 2020
- By:
- Publication type:
- Editorial
3
Longest Increasing Subsequence under Persistent Comparison Errors.
- Published in:
- Theory of Computing Systems, 2020, v. 64, n. 4, p. 662, doi. 10.1007/s00224-020-09966-9
- By:
- Publication type:
- Article
4
Approximating Node-Weighted k-MST on Planar Graphs.
- Published in:
- Theory of Computing Systems, 2020, v. 64, n. 4, p. 626, doi. 10.1007/s00224-020-09965-w
- By:
- Publication type:
- Article
5
Deterministic Min-Cost Matching with Delays.
- Published in:
- Theory of Computing Systems, 2020, v. 64, n. 4, p. 572, doi. 10.1007/s00224-019-09963-7
- By:
- Publication type:
- Article
6
Advice Complexity of Priority Algorithms.
- Published in:
- Theory of Computing Systems, 2020, v. 64, n. 4, p. 593, doi. 10.1007/s00224-019-09955-7
- By:
- Publication type:
- Article
7
An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals.
- Published in:
- Theory of Computing Systems, 2020, v. 64, n. 4, p. 645, doi. 10.1007/s00224-019-09947-7
- By:
- Publication type:
- Article