Author:
Escoffier Bruno,Gourvès Laurent,Monnot Jérôme
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference35 articles.
1. Some APX-completeness results for cubic graphs;Alimonti;Theoret. Comput. Sci.,2000
2. Approximating the tree tour covers of a graph;Arkin;Inform. Process. Lett.,1993
3. Complexity and Approximation (Combinatorial Optimization Problems and Their Approximability Properties);Ausiello,1999
4. Approximation algorithms for NP-complete problems on planar graphs;Baker;J. ACM,1994
5. R. Bar-Yehuda, S. Even, On approximating a vertex cover for planar graphs, in: Proceedings of the Annual ACM Symposium on Theory of Computing, STOC'82, 1982, pp. 303–309
Cited by
39 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献