Author:
Berger André,Fukunaga Takuro,Nagamochi Hiroshi,Parekh Ojas
Subject
General Computer Science,Theoretical Computer Science
Reference15 articles.
1. Approximating the tree and tour cover of graph;Arkin;Information Processing Letters,1993
2. Proving integrality gaps without knowing the linear program;Arora,2002
3. Linear time algorithms for generalized edge dominating set problems;Berger,2005
4. A 2 1/10-approximation algorithm for a generalization of the weighted edge-dominating set problem;Carr;Journal of Combinatorial Optimization,2001
5. M. Chlebík, J. Chlebíková, Approximation hardness of minimum edge dominating set and minimum maximal matching, in: Proceedings of the 14th Annual International Symposium on Algorithms and Computation, ISAAC2003, 2003, pp. 415–424
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献