Routing with Minimum Wire Length in the Dogleg-Free Manhattan Model is NP-Complete.

Tibor Szkaliczki

Published in: SIAM J. Comput. (1999)

Keyphrases

np complete
computational model
statistical model
database
data sets
parameter estimation
formal model
probabilistic model
prediction model
image sequences
video sequences
cost function
np hard
theoretical analysis
wireless networks