Login / Signup
Huge tables and multicommodity flows are fixed-parameter tractable via unimodular integer Carathéodory.
Shmuel Onn
Published in:
J. Comput. Syst. Sci. (2017)
Keyphrases
</>
fixed parameter tractable
parameterized complexity
computational problems
np hard
np complete
global constraints
database
databases
bounded treewidth
conjunctive queries
network design problem
database systems
special case
minimum cost
abstract argumentation