Author:
Chlebík Miroslav,Chlebíková Janka
Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification an hardness of approximation problems. Proceedings of the 33rd Annual Symposium on Fundations of Computer Science, 1992, 14–23.
2. Bern, M., Plassmann, P.: The Steiner Problem with edge lengths 1 and 2. Information Processing Letters 32 (1989) 171–176
3. Chun, F. R. K.: Spectral Graph Theory. CBMS Regional Conference Series in Mathematics, American Mathematical Society, 1997, ISSN 0160-7642, ISBN 0-8218-0315-8.
4. Håstad, J.: Some optimal inapproximability results. Proceedings of the 28rd Annual Symposium on Theory of Computing, ACM, 1997.
5. Hougardy, S., Gröpl, C., Nierhoff, T., Prömel, H. J.: Approximation algorithms for the Steiner tree problem in graphs. In Steiner Trees in Industry, (X. Cheng and D.-Z. Du, eds.), Kluwer Academic Publishers, 2001, 235–279.
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献