The Complement of Hypergraph Capacitated Min-k-Cut Problem.
Wenxing ZhuJiarui ChenPublished in: PAAP (2010)
Keyphrases
- np hard
- multicommodity flow
- minimum total cost
- vertex set
- lot sizing
- higher order
- routing problem
- facility location
- single source
- multi commodity
- multi source
- vehicle routing problem
- hypergraph model
- network design problem
- multi item
- capacity constraints
- total cost
- multi period
- pairwise
- high order
- facility location problem
- production inventory
- approximation algorithms
- hypergraph partitioning
- spanning tree
- lower bound
- undirected graph
- data sets
- integer programming
- data fusion
- clustering algorithm
- genetic algorithm