An Approximation Algorithm for the General Mixed Packing and Covering Problem.
Florian DiedrichKlaus JansenPublished in: ESCAPE (2007)
Keyphrases
- learning algorithm
- computational complexity
- closed form
- matching algorithm
- optimal solution
- times faster
- cost function
- detection algorithm
- theoretical analysis
- high accuracy
- objective function
- approximation ratio
- improved algorithm
- recognition algorithm
- ant colony optimization
- probabilistic model
- computational cost
- experimental evaluation
- dynamic programming
- multi objective
- optimization algorithm
- clustering method
- np hard
- special case
- error bounds
- k means
- search space
- packing problem
- preprocessing
- error tolerance