On Online Algorithms with Advice for the k-Server Problem.
- Published in:
- Theory of Computing Systems, 2015, v. 56, n. 1, p. 3, doi. 10.1007/s00224-012-9434-z
- By:
- Publication type:
- Article
Works matching IS 14324350 AND DT 2015 AND VI 56 AND IP 1
Results: 14
1
2
A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines Without Preemption.
- Published in:
- Theory of Computing Systems, 2015, v. 56, n. 1, p. 73, doi. 10.1007/s00224-013-9451-6
- By:
- Publication type:
- Article
3
Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models.
- Published in:
- Theory of Computing Systems, 2015, v. 56, n. 1, p. 82, doi. 10.1007/s00224-013-9475-y
- By:
- Publication type:
- Article
4
Improved Lower Bound for Online Strip Packing.
- Published in:
- Theory of Computing Systems, 2015, v. 56, n. 1, p. 41, doi. 10.1007/s00224-013-9494-8
- By:
- Publication type:
- Article
5
Some Anomalies of Farsighted Strategic Behavior.
- Published in:
- Theory of Computing Systems, 2015, v. 56, n. 1, p. 156, doi. 10.1007/s00224-013-9529-1
- By:
- Publication type:
- Article
6
Online Results for Black and White Bin Packing.
- Published in:
- Theory of Computing Systems, 2015, v. 56, n. 1, p. 137, doi. 10.1007/s00224-014-9538-8
- By:
- Publication type:
- Article
7
Probabilistic k-Median Clustering in Data Streams.
- Published in:
- Theory of Computing Systems, 2015, v. 56, n. 1, p. 251, doi. 10.1007/s00224-014-9539-7
- By:
- Publication type:
- Article
8
Approximation Algorithms for Fragmenting a Graph Against a Stochastically-Located Threat.
- Published in:
- Theory of Computing Systems, 2015, v. 56, n. 1, p. 96, doi. 10.1007/s00224-014-9548-6
- By:
- Publication type:
- Article
9
Special Issue on Approximation and Online Algorithms.
- Published in:
- 2015
- By:
- Publication type:
- Editorial
10
Approximating Spanning Trees with Few Branches.
- Published in:
- Theory of Computing Systems, 2015, v. 56, n. 1, p. 181, doi. 10.1007/s00224-014-9556-6
- By:
- Publication type:
- Article
11
Special Issue on Approximation and Online Algorithms.
- Published in:
- 2015
- By:
- Publication type:
- Editorial
12
On Minimum- and Maximum-Weight Minimum Spanning Trees with Neighborhoods.
- Published in:
- Theory of Computing Systems, 2015, v. 56, n. 1, p. 220, doi. 10.1007/s00224-014-9591-3
- By:
- Publication type:
- Article
13
Advice Complexity of Maximum Independent set in Sparse and Bipartite Graphs.
- Published in:
- Theory of Computing Systems, 2015, v. 56, n. 1, p. 197, doi. 10.1007/s00224-014-9592-2
- By:
- Publication type:
- Article
14
OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm.
- Published in:
- Theory of Computing Systems, 2015, v. 56, n. 1, p. 22, doi. 10.1007/s00224-012-9427-y
- By:
- Publication type:
- Article