Polynomial-Time Algorithms for Multivariate Linear Problems with Finite-Order Weights: Worst Case Setting.
Grzegorz W. WasilkowskiHenryk WozniakowskiPublished in: Found. Comput. Math. (2005)
Keyphrases
- worst case
- optimization problems
- average case
- computational complexity
- theoretical guarantees
- worst case analysis
- computational problems
- upper bound
- approximation algorithms
- run times
- benchmark problems
- data structure
- problems in computer vision
- greedy algorithm
- theoretical analysis
- error bounds
- tunable parameters
- times faster
- test problems
- space complexity
- minimum cost flow
- weight vector
- complexity bounds
- lower bound
- np hard
- learning algorithm
- computationally hard
- np hardness
- online algorithms
- evolutionary algorithm
- multi class
- linear systems
- combinatorial optimization