A Combinatorial Approximation Algorithm for Graph Balancing with Light Hyper Edges.
Chien-Chung HuangSebastian OttPublished in: ESA (2016)
Keyphrases
- error bounds
- objective function
- matching algorithm
- cost function
- learning algorithm
- computational complexity
- dominating set
- detection algorithm
- undirected graph
- dynamic programming
- probabilistic model
- weighted graph
- minimum spanning tree
- spanning tree
- k means
- simulated annealing
- graph model
- directed graph
- clustering method
- shortest path problem
- segmentation algorithm
- random graphs
- graph based algorithm