A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and One.
Markus BläserPublished in: APPROX-RANDOM (2004)
Keyphrases
- high accuracy
- worst case
- learning algorithm
- optimal solution
- optimization algorithm
- k means
- dynamic programming
- expectation maximization
- times faster
- detection algorithm
- matching algorithm
- experimental evaluation
- image segmentation
- computational cost
- recognition algorithm
- weighting scheme
- approximation ratio
- np hard
- significant improvement
- artificial neural networks
- computational complexity
- objective function
- clustering algorithm
- simulated annealing
- theoretical analysis
- segmentation algorithm
- cost function
- search space
- closed form