剧情简介：Discrete optimization problems are everywhere, from traditional operations research planning (scheduling, facility location and network design); to computer science databases; to advertising issues in viral marketing. Yet most such problems are NP-hard; unless P = NP, there are no efficient algorithms to find optimal solutions. This book shows how to design approximation algori...(展开全部)
作者：David P·Williamson
出版社：Cambridge University Press
ISBN：9780521195270
