Subject
Computer Networks and Communications,Hardware and Architecture,Information Systems,Software
Reference17 articles.
1. Approximation algorithms for NP-complete problems on planar graphs. In Proceedings of the 24th IEEE Symposium on Foundations of Computer Science (1983).
2. On the Average Number of Maxima in a Set of Vectors and Applications
3. Network design problems: Steiner trees and spanning k-trees. Ph. D. Thesis, Computer Science Division, University of California at Berkeley, 1987.
4. On the Complexity of Covering Vertices by Faces in a Planar Graph
5. The steiner problem in graphs
Cited by
34 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献