An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing.
Hans KellererVladimir KotovPublished in: Oper. Res. Lett. (2003)
Keyphrases
- worst case performance ratio
- packing problem
- input data
- recognition algorithm
- computational cost
- learning algorithm
- matching algorithm
- times faster
- high accuracy
- worst case
- experimental evaluation
- improved algorithm
- dynamic programming
- computational complexity
- segmentation algorithm
- euclidean norm
- detection algorithm
- theoretical analysis
- expectation maximization
- particle swarm optimization
- three dimensional
- linear programming
- closed form
- multi dimensional
- np hard
- k means
- search space
- error tolerance
- lower bound