Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems
- 26 June 1984
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 31 (3) , 459-473
- https://doi.org/10.1145/828.322439
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Finding kth paths and p-centers by generating and searching good data structuresJournal of Algorithms, 1983
- Finding the maximum, merging, and sorting in a parallel computation modelJournal of Algorithms, 1981
- Location on Tree Networks: P-Centre and n-Dispersion ProblemsMathematics of Operations Research, 1981
- Applications of a Planar Separator TheoremSIAM Journal on Computing, 1980
- A Separator Theorem for Planar GraphsSIAM Journal on Applied Mathematics, 1979
- Finding a Maximum Independent SetSIAM Journal on Computing, 1977
- The Parallel Evaluation of General Arithmetic ExpressionsJournal of the ACM, 1974
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- The Optimum Location of Multi-centres on a GraphJournal of the Operational Research Society, 1971