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

Authors:
Yuri Gurevich;Larry Stockmeyer;Uzi Vishkin
Affiliations:
Department of Computer and Communication Sciences, University of Michigan, Ann Arbor, MI;IBM Research Lab. K51/281, 5600 Cottle Road, San Jose, CA;Department of Computer Science, Courant Institute of Mathematical Sciences, 251 Mercer Street, New York, NY
Venue:
Journal of the ACM (JACM)
Year:
1984

Allocating Modules to Processors in a Distributed System

IEEE Transactions on Software Engineering
Data collection for the Sloan Digital Sky Survey—a network-flow heuristic

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Efficient algorithms for center problems in cactus networks

Theoretical Computer Science
Yuri, logic, and computer science

Fields of logic and computation
A new template for solving p-median problems for trees in sub-quadratic time

ESA'05 Proceedings of the 13th annual European conference on Algorithms
Backup 2-center on interval graphs

Theoretical Computer Science
Parameterized complexity of 1-planarity

WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures

Hi-index	0.01