Author:
Akcoglu Karhan,Aspnes James,DasGupta Bhaskar,Kao Ming-Yang
Reference36 articles.
1. Alon, N., Feige, U., Wigderson, A., and Zuckerman, D. (1995). Derandomized graph products. Computational Complexity, 5(1): 6075.
2. Bafna, V., Berman, P., and Fujito, T. (1999). A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM Journal on Discrete Mathematics, 12: 289–297.
3. Banks, J. S., Ledyard, J. 0., and Porter, D. (1989). Allocating uncertain and unresponsive resources: An experimental approach. The Rand Journal of Economics, 20: 1–25.
4. Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J. S., and Schieber, B. (2000). A unified approach to approximating resource allocation and scheduling. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pages 735–744.
5. Bar-Yehuda, R. (2000). One for the price of two• a unified approach for approximating covering problems. Algorithmica,27(2):131144.
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献