On the relationship between the biconnectivity augmentation and travelling salesman problems
Authors:
- Greg N. FredericksonGFGreg N. Frederickson
- Joseph Ja'JA'JJJoseph Ja'JA'
- 1 August 1982
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 19 (2) , 189-201
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Approximation Algorithms for Several Graph Augmentation ProblemsSIAM Journal on Computing, 1981
- Smallest Augmentations to Biconnect a GraphSIAM Journal on Computing, 1977
- Finding Minimum Spanning TreesSIAM Journal on Computing, 1976
- Augmentation ProblemsSIAM Journal on Computing, 1976
- Priority queues with update and finding minimum spanning treesInformation Processing Letters, 1975
- An 0(|E|loglog|V|) algorithm for finding minimum spanning treesInformation Processing Letters, 1975
- Approximation algorithms for combinatorial problemsJournal of Computer and System Sciences, 1974
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Dynamic Programming Treatment of the Travelling Salesman ProblemJournal of the ACM, 1962
- On the shortest spanning subtree of a graph and the traveling salesman problemProceedings of the American Mathematical Society, 1956