Login / Signup
Train Marshalling Is Fixed Parameter Tractable.
Leo Brueggeman
Michael R. Fellows
Rudolf Fleischer
Martin Lackner
Christian Komusiewicz
Yiannis Koutis
Andreas Pfandler
Frances A. Rosamond
Published in:
FUN (2012)
Keyphrases
</>
fixed parameter tractable
parameterized complexity
np hard
np complete
computational problems
global constraints
optimal solution
lower bound
conjunctive queries
bounded treewidth
data model
integrity constraints
approximation algorithms
minimum cost