An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem.
Yusuke MatsumotoNaoyuki KamiyamaKeiko ImaiPublished in: Inf. Process. Lett. (2011)
Keyphrases
- computational complexity
- matching algorithm
- learning algorithm
- preprocessing
- detection algorithm
- dynamic programming
- optimal solution
- optimization algorithm
- constant factor
- worst case
- minimum distance
- space complexity
- particle swarm optimization
- randomized algorithm
- k means
- multiagent evolutionary algorithm
- square error
- matching process
- weighted graph
- memory requirements
- error bounds
- cost function
- search space
- image matching
- segmentation algorithm
- np hard
- multi objective
- edge detection algorithm
- objective function