Approximation algorithms for homogeneous polynomial optimization with quadratic constraints.
Simai HeZhening LiShuzhong ZhangPublished in: Math. Program. (2010)
Keyphrases
- approximation algorithms
- quadratic program
- np hard
- special case
- constrained optimization
- precedence constraints
- vertex cover
- worst case
- network design problem
- primal dual
- facility location problem
- approximation ratio
- randomized algorithms
- computational complexity
- open shop
- exact algorithms
- minimum cost
- optimization problems
- combinatorial auctions
- objective function
- np hardness
- set cover
- constraint programming
- approximation schemes
- constant factor
- polynomial time approximation
- disjoint paths
- linear constraints
- upper bound
- lower bound