Author:
Angelopoulos Spyros,Borodin Allan
Subject
General Computer Science,Theoretical Computer Science
Reference55 articles.
1. S. Albers, On randomized online scheduling, in: Proceedings of the 34th Annual ACM Symposium on Theory of Computation, STOC, 2002, pp. 134–143.
2. M. Alekhnovich, A. Borodin, J. Buresh-Oppenheim, R. Impagliazzo, A. Magen, T. Pitassi, Toward a model for backtracking and dynamic programming, in: Proceedings of the 20th Annual IEEE Conference on Computational Complexity, CCC, 2005, pp. 308–322.
3. S. Angelopoulos, Order preserving transformations and greedy-like algorithms, in: Proceedings of the Second Workshop on Approximation and Online Algorithms, WAOA, 2004, pp. 27–40.
4. The power of priority algorithms for facility location and set cover;Angelopoulos;Algorithmica,2004
5. Social Choice and Individual Values;Arrow,1951
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献