1-local 33/24-competitive Algorithm for Multicoloring Hexagonal Graphs.
Rafal WitkowskiJanez ZerovnikPublished in: Discret. Math. Theor. Comput. Sci. (2013)
Keyphrases
- dynamic programming
- learning algorithm
- optimal solution
- k means
- computational complexity
- experimental evaluation
- times faster
- detection algorithm
- segmentation algorithm
- significant improvement
- computational cost
- expectation maximization
- simulated annealing
- np hard
- objective function
- theoretical analysis
- image processing
- graph structure
- graph isomorphism
- neural network
- worst case
- cost function
- particle swarm optimization
- similarity measure
- social networks
- convergence rate
- graph model
- regular grid