Esther M. Arkin, Magnús M. Halldórsson, Refael Hassin  Home/Search
Context Related
| math.tau.ac.il/~hass...tree_cover.ps.gz sunysb.edu/~estie/pa...tree_cover.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: math.tau.ac.il/~hassin/ (more) From: sunysb.edu/~estie/publications (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The tree and tour cover problems on an edge-weighted graph are to compute a minimum weight tree and closed walk, respectively, whose vertices form a vertex cover. Both problems are NP-hard. In this note we give strongly polynomial time, constant factor approximation algorithms for both problems. An interesting feature of our algorithms is how they combine approximations of other problems, namely the weighted vertex cover, traveling salesman, and Steiner tree problems. y Information Processing... (Update)
Similar documents based on text: More All
0.4: A Branch-and-Cut Algorithm for the Undirected.. - Laporte.. (Correct)
0.4: Increasing Digraph Arc-Connectivity by Arc Addition.. - Arkin, Hassin, Shahar (2001) (Correct)
0.4: Randomized Planning for Short Inspection Paths - Danner, Kavraki (2000) (Correct)
Related documents from co-citation: More All
4: personal communication (context) - Berman - 1996
4: Improved Steiner Tree Approximation in Graphs - Robins, Zelikovsky - 2000
3: Computers and Intractability: A Guide to the Theory of NP-Completeness (context) - Garey, Johnson - 1979
BibTeX entry: (Update)
E. Arkin, M. Halld'orsson and R. Hassin, "Approximating the tree and tour covers of a graph", Information Processing Letters, 47: 275--282, (1993). http://citeseer.ist.psu.edu/arkin96approximating.html More
@article{ arkin93approximating,
author = "Esther M. Arkin and Magnus M. Halldorsson and Refael Hassin",
title = "Approximating the Tree and Tour Covers of a Graph",
journal = "Information Processing Letters",
volume = "47",
number = "6",
pages = "275-282",
year = "1993",
url = "citeseer.ist.psu.edu/arkin96approximating.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NPCom.. (context) - Garey, Johnson - 1978
403 Proof verification and hardness of approximation problems - Arora, Lund et al. - 1992
206 Rinehart and Winston (context) - Lawler, Optimization et al. - 1976
126 Efficient probabilistically checkable proofs: Applications t.. - Bellare, Goldwasser et al. - 1993
77 Worst-case analysis of a new heuristic for the traveling sal.. (context) - Christofides - 1976
75 Approximation algorithms for the set covering and vertex cov.. (context) - Hochbaum - 1982
59 Improved approximations for the Steiner tree problem (context) - Berman, Ramaiyer - 1992
52 A local-ratio theorem for approximating the weighted vertex .. (context) - Bar-Yehuda, Even - 1985
34 Ramsey numbers and an approximation algorithm for the vertex.. (context) - Monien, Speckenmeyer - 1985
31 A faster approximation algorithm for the Steiner problem in .. (context) - Mehlhorn - 1988
30 Lecture notes on approximation algorithms (context) - Motwani - 1992
27 A note on the prize collecting traveling salesman problem (context) - Bienstock, Goemans et al. - 1993
18 Optimum watchman routes (context) - Chin, Ntafos - 1988
11 A faster approximation algorithm for the Steiner tree proble.. (context) - Zelikovsky - 1993
9 The optimal location of a path or tree in a tree network (context) - Minieka - 1985
9 On locating path- or tree-shaped facilities on networks (context) - Hakimi, Schmeichel et al. - 1990
7 Approximate algorithms for the traveling purchaser problem (context) - Ong - 1982
4 and R.E. Karp, "An n 5=2 algorithm for maximal matchings in .. (context) - Hopcroft - 1973
4 Optimal location of a path or tree on a network with cycles (context) - Richey - 1990
2 Location of a tree shaped facility in a network (context) - Aneja, Nair - 1992
2 A minimum length covering subgraph of a network (context) - Kim, Lowe et al. - 1989
1 The location of central structures in trees (context) - Kincaid, Lowe et al. - 1988
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.math.tau.ac.il/~hassin/): More
The Scheduling of Maintenance Service - Anily, Glass, Hassin (1995) (Correct)
An Approximation Algorithm for Maximum Packing of 3-Edge Paths - Hassin, Rubinstein (1997) (Correct)
On the Advantage of Being the First Server - Refael Hassin (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC