Metro-Line Crossing Minimization: Hardness, Approximations, and Tractable Cases.

Martin Fink Sergey Pupyrev

Published in: CoRR (2013)

Keyphrases

tractable cases
causal models
computational complexity
np complete
objective function
learning theory
reinforcement learning
relational databases
np hard
worst case
random walk
phase transition
np hardness
bounded treewidth