Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows.
Norbert SensenPublished in: ESA (2001)
Keyphrases
- exact algorithms
- graph partitioning
- lower bound
- exact solution
- max sat
- network design problem
- upper bound
- approximation algorithms
- knapsack problem
- np hard
- graph model
- branch and bound
- branch and bound algorithm
- partitioning algorithm
- network design
- image segmentation
- worst case
- clustering algorithm
- optimal solution
- lower and upper bounds
- objective function
- combinatorial problems
- spectral clustering
- network flow
- weighted graph
- data clustering
- combinatorial optimization problems
- combinatorial optimization
- lagrangian relaxation
- heuristic methods
- cutting plane
- min cut
- exact methods
- bipartite graph
- superpixels
- information retrieval
- metaheuristic
- np complete
- linear programming
- image processing
- column generation
- multiscale