Publisher
Springer International Publishing
Reference7 articles.
1. Arkin, E.M., Halldórsson, M.M., Hassin, R.: Approximating the tree and tour covers of a graph. Information Processing Letters 47, 275–282 (1993)
2. Carr, R., Fujito, T., Konjevod, G., Parekh, O.: A 2 1/10-approximation algorithm for a generalization of the weighted edge-dominating set problem. Journal of Combinatorial Optimization 5(3), 317–326 (2001)
3. Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Technical Report 388, Graduate School of Industrial Administration, Carnegie Mellon University (1976)
4. Edmonds, J., Johnson, E.L.: Matching: A Well-solved Class of Integer Linear Programs. In: Combinatorial Optimization - Eureka, You Shrink!, pp. 27–30. Springer-Verlag New York, Inc., New York (2003)
5. Fujito, T.: How to trim a mst: A 2-approximation algorithm for minimum cost-tree cover. ACM Trans. Algorithms 8(2), 16:1–16:11 (2012)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Graph Covering Using Bounded Size Subgraphs;Algorithms and Discrete Applied Mathematics;2023