On Hierarchies of Strong SDP Relaxations for Combinatorial Optimization Problems
Studying the approximation threshold of NP-hard optimization problems, i.e. the ratio of the objective value achievable by a polynomial time algorithm to that of the optimal solution is an important field in theoretical computer science. In the past two decades there has been significant development...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en_ca |
| Published: |
2012
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1807/33933 |