A fast $(2 + \frac{2}{7})$-approximation algorithm for capacitated cycle covering.
Vera TraubThorben TröbstPublished in: Math. Program. (2022)
Keyphrases
- np hard
- times faster
- computational cost
- preprocessing
- convex hull
- k means
- cost function
- dynamic programming
- benchmark problems
- computational complexity
- optimization algorithm
- experimental evaluation
- convergence rate
- error bounds
- constant factor
- expectation maximization
- segmentation algorithm
- matching algorithm
- significant improvement
- search space
- optimal solution
- randomized approximation
- network design problem
- neural network
- closed form
- objective function
- similarity measure