Now showing items 1-1 of 1
Algorithmic aspects of connectivity, allocation and design problems
(Georgia Institute of Technology, 2008-05-23)
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 ...