Approximating Multi Commodity Network Design on Graphs of Bounded Pathwidth and Bounded Degree.
Kord EickmeyerKen-ichi KawarabayashiPublished in: SAGT (2013)
Keyphrases
- network design
- multi commodity
- bounded treewidth
- bounded degree
- heuristic solution
- facility location
- np complete
- graph theoretic
- network design problem
- conjunctive queries
- communication networks
- network architecture
- decision problems
- boolean functions
- network flow problem
- relational learning
- neural network
- integer programming
- query evaluation
- special case
- genetic algorithm