A Convex-Hull Based Algorithm to Connect the Maximal Independent Set in Unit-Disk Graphs.
Dechang ChenXilong MaoXia FeiKai XingFang LiuMin SongPublished in: WASA (2006)
Keyphrases
- convex hull
- independent set
- learning algorithm
- computational complexity
- objective function
- dynamic programming
- point sets
- recursive algorithm
- minimum distance
- data sets
- extreme points
- computational geometry
- finite set of points
- simple polygon
- minimum spanning tree
- mixed integer
- graph structure
- feasible solution
- simulated annealing
- np hard
- high dimensional