A new algorithm and improved lower bound for point placement on a line in two rounds.
Md. Shafiul AlamAsish MukhopadhyayPublished in: CCCG (2010)
Keyphrases
- improved algorithm
- lower bound
- optimal solution
- learning algorithm
- detection algorithm
- dynamic programming
- optimization algorithm
- worst case
- experimental evaluation
- average case
- np hard
- significant improvement
- objective function
- computational complexity
- theoretical analysis
- upper bound
- k means
- computational cost
- expectation maximization
- neural network
- convex hull
- similarity measure
- competitive ratio
- search space
- high accuracy
- cost function
- preprocessing
- convergence rate
- knapsack problem