Author:
Carr Robert,Fujito Toshihiro,Konjevod Goran,Parekh Ojas
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. S. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and hardness of approximation problems. In Proceedings of the 33rdAnnual IEEE Symposium on Foundations of Computer Science, pages 14–23, 1992.
2. B. Baker. Approximation algorithms for NP-complete problems on planar graphs. J. ACM, 41:153–180, 1994.
3. V. Chvátal. A greedy heuristic for the set-covering problem. Math. Oper. Res., 4(3):233–235, 1979.
4. J. Edmonds and E. Johnson. Matching, a well solved class of integer linear programs. In Combinatorial Structures and Their Applications, pages 89–92. Gordon & Breach, New York, 1970.
5. U. Feige. A threshold of ln n for approximating set cover. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pages 314–318, May 1996.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献