Constructing Minimum Changeover Cost Arborescenses in Bounded Treewidth Graphs.

Didem Gözüpek Hadas Shachnai Mordechai Shalom Shmuel Zaks

Published in: CTW (2015)

Keyphrases

bounded treewidth
np complete
minimum cost
highly parallelizable
conjunctive queries
decision problems
scheduling problem
boolean functions
computational complexity
np hard
relational learning
spanning tree
monadic datalog
query answering
integrity constraints
supervised learning
query processing
database