Author:
Feder Tomás,Motwani Rajeev,O'Callaghan Liadan,Olston Chris,Panigrahy Rina
Subject
Computational Theory and Mathematics,Computational Mathematics,Control and Optimization
Reference11 articles.
1. Fast estimation of diameter and shortest paths (without matrix multiplication);Aingworth;SIAM J. Comput.,1999
2. P. Berman, M. Karpinski, On some tighter inapproximability results, DIMACS Technical Report 99–23, 1999
3. X. Deng, T. Kameda, C. Papadimitriou, How to learn an unknown environment, J. ACM, in press
4. Computing the median with uncertainty;Feder,2000
5. Matchings and covers in hypergraphs;Füredi;Graphs Combin.,1988
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献