A Faster Algorithm for the Minimum Red-Blue-Purple Spanning Graph Problem for Points on a Circle.
Ahmad BiniazProsenjit BoseIngo van DuijnAnil MaheshwariMichiel H. M. SmidPublished in: CCCG (2016)
Keyphrases
- learning algorithm
- memory efficient
- graph structure
- detection algorithm
- spanning tree
- worst case
- dominating set
- np hard
- computational complexity
- dynamic programming
- simulated annealing
- segmentation algorithm
- convex hull
- shortest path problem
- objective function
- graph based algorithm
- k means
- clustering method
- preprocessing
- undirected graph
- minimum spanning tree
- delaunay triangulation
- similarity measure