
Data and Computer Communications
Gurdeep S. Hura
₹4,610

by David P. Williamson, David B. Shmoys
Free delivery. Nothing extra to pay at checkout.
Discrete optimization problems are everywhere, from traditional operations research planning problems, such as scheduling, facility location, and network design; to computer science problems in databases; to advertising issues in viral marketing. Yet most such problems are NP-hard. Thus unless P = NP, there are no efficient algorithms to find optimal solutions to such problems.
Description supplied by the publisher.