Approximating the tree and tour covers of a graph
- 1 October 1993
- journal article
- Published by Elsevier BV in Information Processing Letters
- Vol. 47 (6), 275-282
- https://doi.org/10.1016/0020-0190(93)90072-h
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- A faster approximation algorithm for the steiner tree problem in graphsInformation Processing Letters, 1993
- A note on the prize collecting traveling salesman problemMathematical Programming, 1993
- Optimal location of a path or tree on a network with cyclesNetworks, 1990
- The location of central structures in treesComputers & Operations Research, 1988
- Optimum watchman routesInformation Processing Letters, 1988
- A faster approximation algorithm for the Steiner problem in graphsInformation Processing Letters, 1988
- The optimal location of a path or tree in a tree networkNetworks, 1985
- Approximate algorithms for the travelling purchaser problemOperations Research Letters, 1982
- Approximation Algorithms for the Set Covering and Vertex Cover ProblemsSIAM Journal on Computing, 1982
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973