Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems

Yuri Gurevich, Larry J. Stockmeyer, Uzi Vishkin. Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems. Journal of the ACM, 31(3):459-473, 1984. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.