Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs.
Jiong GuoFalk HüffnerErhan KenarRolf NiedermeierJohannes UhlmannPublished in: Eur. J. Oper. Res. (2008)
Keyphrases
- bounded treewidth
- exact algorithms
- np complete
- decision problems
- approximation algorithms
- knapsack problem
- fixed parameter tractable
- exact solution
- np hard
- computational problems
- conjunctive queries
- boolean functions
- undirected graph
- constraint satisfaction problems
- computational complexity
- heuristic methods
- max sat
- combinatorial optimization
- special case
- combinatorial optimization problems
- optimal solution
- combinatorial problems
- relational learning
- information retrieval
- monadic datalog
- satisfiability problem
- cellular automata
- worst case
- objective function