Login / Signup
Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems.
Yuri Gurevich
Larry J. Stockmeyer
Uzi Vishkin
Published in:
J. ACM (1984)
Keyphrases
</>
np hard problems
facility location problem
combinatorial search
np hard
graph coloring
approximation algorithms
knapsack problem
constraint programming
subgraph isomorphism
facility location
graph matching
special case
combinatorial optimization
weighted graph
combinatorial problems