A Combinatorial Approximation Algorithm for Graph Balancing with Light Hyper Edges.
Chien-Chung HuangSebastian OttPublished in: CoRR (2015)
Keyphrases
- learning algorithm
- undirected graph
- dynamic programming
- graph construction
- computational complexity
- spanning tree
- objective function
- search space
- weighted graph
- np hard
- constant factor
- tree structure
- approximation algorithms
- graph structure
- detection algorithm
- worst case
- graph based algorithm
- minimum spanning tree
- maximum weight
- strongly connected components
- bipartite graph
- graph matching
- error bounds
- random walk
- expectation maximization
- particle swarm optimization
- graphical models
- probabilistic model
- cost function
- k means
- bayesian networks