Algorithmic aspects of connectivity, allocation and design problems
Most combinatorial optimization problems are NP -hard, which imply that under well- believed complexity assumptions, there exist no polynomial time algorithms to solve them. To cope with the NP-hardness, approximation algorithms which return solutions close to the optimal, have become a rich fiel...
| Main Author: | |
|---|---|
| Published: |
Georgia Institute of Technology
2008
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1853/24659 |