Algorithms for storage allocation based on client preferences-Reference-Cited by-同舟云学术

Algorithms for storage allocation based on client preferences

Published:2009-08-27 Issue:3 Volume:19 Page:304-324
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Tamir Tami,Vaksendiser Benny

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s10878-009-9259-0.pdf

Reference26 articles.

1. Bar-Noy A, Ladner RE (2004) Efficient algorithms for optimal stream merging for media-on-demand. SIAM J Comput 33(5):1011–1034

2. Bar-Noy A, Ladner RE, Tamir T (2003) Scheduling techniques for media-on-demand. In: Proc of the 14th ACM-SIAM symposium on discrete algorithms, pp 791–800

3. Chou CF, Golubchik L, Lui JCS (2000) A performance study of dynamic replication techniques in continuous media servers. In: Proc of the international symposium on modeling, analysis and simulation of computer and telecommunication systems (IEEE MASCOTS), pp 256–264

4. Feige U (1998) A threshold of ln n for approximating set cover. J ACM 45(4):634–652

5. Feige U (2003) Vertex cover is hardest to approximate on regular graphs. Technical Report MCS03-15, Computer Science and Applied Mathematics, The Weizmann Institute of Science

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Resource Allocation Games with Multiple Resource Classes;Approximation and Online Algorithms;2017

2. Faster Algorithms for Semi-Matching Problems;ACM Transactions on Algorithms;2014-06

3. Resource Allocation Problems;Handbook of Combinatorial Optimization;2013

4. Faster Algorithms for Semi-matching Problems (Extended Abstract);Automata, Languages and Programming;2010