Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem.

Tibor Jordán Ildikó Schlotter

Published in: J. Discrete Algorithms (2015)

Keyphrases

parameterized complexity
capacity allocation
square root
fixed parameter tractable
global constraints
np hard
budget constraints
np complete
computational problems
information retrieval
special case
kalman filtering
symmetry breaking
bounded treewidth