Author:
Chlebík Miroslav,Chlebíková Janka
Subject
General Computer Science,Theoretical Computer Science
Reference16 articles.
1. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification an hardness of approximation problems, in: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992, pp. 14–23
2. Asymptotically optimal switching circuits;Bassalygo;Problems in Information Transmission,1981
3. The Steiner problem with edge lengths 1 and 2;Bern;Information Processing Letters,1989
4. Approximation hardness for small occurrence instances of NP-hard problems;Chlebík,2003
5. On concentrators, superconcentrators, generalizers, and nonblocking networks;Chung;The Bell System Technical Journal,1978
Cited by
76 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献