Brief announcement: a local approximation algorithm for MDS problem in anonymous planar networks.
Wojciech WawrzyniakPublished in: PODC (2013)
Keyphrases
- learning algorithm
- computational cost
- times faster
- dynamic programming
- np hard
- detection algorithm
- optimization algorithm
- k means
- theoretical analysis
- cost function
- error bounds
- simulated annealing
- segmentation algorithm
- expectation maximization
- high accuracy
- worst case
- preprocessing
- experimental evaluation
- convergence rate
- convex hull
- multidimensional scaling
- matching algorithm
- input data
- dimensionality reduction
- social networks