Login / Signup
Complexity of 3-D floorplans by analysis of graph cuboidal dual hardness.
Renshen Wang
Evangeline F. Y. Young
Chung-Kuan Cheng
Published in:
ACM Trans. Design Autom. Electr. Syst. (2010)
Keyphrases
</>
np hard
worst case
data sets
computational cost
databases
information retrieval
objective function
computational complexity
pairwise
special case
data mining
mobile robot
real time
np complete
random walk
statistical analysis
decision problems
np hardness