Polynomial-Time Algorithms for Multivariate Linear Problems with Finite-Order Weights; Worst Case Setting.
Grzegorz W. WasilkowskiHenryk WozniakowskiPublished in: Algorithms and Complexity for Continuous Problems (2004)
Keyphrases
- worst case
- optimization problems
- error bounds
- computational complexity
- upper bound
- theoretical guarantees
- complexity bounds
- average case
- polynomial time complexity
- benchmark problems
- test problems
- lower bound
- practical problems
- worst case analysis
- running times
- online algorithms
- space complexity
- data structure
- approximation algorithms
- greedy algorithm
- np hard
- special case
- weight vector
- partial solutions
- problems in computer vision
- linear space
- combinatorial optimization
- theoretical analysis
- np hardness
- computationally hard
- fixed parameter tractable
- evolutionary algorithm
- tunable parameters