Interactive proof system variants and approximation algorithms for optical networks
作者： Ravi Sundaram
DOI:
关键词:
摘要:
参考文章(97)
Russell Impagliazzo, Michael Luby, Leonid A. Levin, Pseudo-random Generation from one-way functions (Extended Abstracts) symposium on the theory of computing. pp. 12- 24 ,(1989)
László Babai, Transparent Proofs and Limits to Approximation Birkhäuser Basel. pp. 31- 91 ,(1994) , 10.1007/978-3-0348-9110-3_2
Qing Zhu, Mehrdad Parsa, Wayne W.M. Dai, AN ITERATIVE APPROACH FOR DELAY-BOUNDED MINIMUM STEINER TREE CONSTRUCTION University of California at Santa Cruz. ,(1994)
Uriel Feige, Laszlo Lovasz, Two-prover one-round proof systems: Their power and their problems symposium on the theory of computing. ,(1992)
U. Feige, A. Shamir, M. Tennenholtz, The Noisy Oracle Problem international cryptology conference. pp. 284- 296 ,(1988) , 10.1007/0-387-34799-2_22
Anne Elizabeth Condon, Computational Models of Games ,(1989)
Madhav V. Marathe, R. Ravi, R. Sundaram, Service-Constrained Network Design Problems scandinavian workshop on algorithm theory. pp. 28- 40 ,(1996) , 10.1007/3-540-61422-2_118
Avrim Blum, R Ravi, Santosh Vempala, A Constant-Factor Approximation Algorithm for thek-MST Problem Journal of Computer and System Sciences. ,vol. 58, pp. 101- 108 ,(1999) , 10.1006/JCSS.1997.1542
Paul Eliot Green, Fiber Optic Networks ,(1992)