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]

Authors

Yuri Gurevich

This author has not been identified. It may be one of the following persons: Look up 'Yuri Gurevich' in Google

Larry J. Stockmeyer

This author has not been identified. Look up 'Larry J. Stockmeyer' in Google

Uzi Vishkin

This author has not been identified. Look up 'Uzi Vishkin' in Google