A polynomial-time tree decomposition to minimize congestion.
Chris HarrelsonKirsten HildrumSatish RaoPublished in: SPAA (2003)
Keyphrases
- tree decomposition
- tree width
- constraint networks
- decomposition method
- probabilistic reasoning
- branch and bound
- parallel processing
- graph theory
- packet transmission
- reasoning problems
- hypertree decomposition
- tree decompositions
- special case
- answer set programming
- constraint satisfaction problems
- computational complexity
- decomposition methods
- belief networks
- worst case
- temporal reasoning
- logic programs
- lower bound