An Asymptotic O(ln rho/ln ln rho)-Approximation Algorithm for the Scheduling Problem with Duplication on Large Communication Delay Graphs.
Renaud LepèreChristophe RapinePublished in: STACS (2002)
Keyphrases
- learning algorithm
- scheduling problem
- np hard
- computational complexity
- detection algorithm
- graph structure
- objective function
- optimal solution
- k means
- cost function
- dynamic programming
- theoretical analysis
- probabilistic model
- error tolerance
- approximation algorithms
- simulated annealing
- search space
- preprocessing
- similarity measure
- linear programming
- error bounds
- graph model
- approximation ratio
- polynomial time approximation
- image segmentation