The Rectilinear Steiner Tree Problem in NP Complete.
M. R. GareyDavid S. JohnsonPublished in: SIAM Journal of Applied Mathematics (1977)
Keyphrases
- np complete
- np hard
- satisfiability problem
- computational complexity
- pspace complete
- randomly generated
- prize collecting
- multicast routing
- np complete problems
- constraint satisfaction problems
- phase transition
- conjunctive queries
- polynomial time complexity
- d mesh
- bounded treewidth
- polynomially solvable
- ground plane
- steiner tree
- lower bound
- web services