On the approximability of some NP-hard minimization problems for linear systems
Edoardo AmaldiViggo KannPublished in: Electron. Colloquium Comput. Complex. (1996)
Keyphrases
- linear systems
- minimization problems
- np hard
- approximation algorithms
- interior point
- total variation
- sufficient conditions
- dynamical systems
- low rank
- special case
- optimal solution
- sparse linear systems
- lower bound
- integer programming
- worst case
- cutting plane
- linear programming
- interior point methods
- image restoration
- computational complexity
- mumford shah
- knapsack problem
- linear combination
- linear program
- state space
- learning algorithm