The design of approximation algorithms /

other_versions_link

"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...

Full beskrivning

Bibliografiska uppgifter
Huvudupphovsman: Williamson, David P.
Övriga upphovsmän: Shmoys, David Bernard
Materialtyp: Printed Book
Språk:English
Publicerad: New York : Cambridge University Press, 2011.
Ämnen:
Approximation theory.
Mathematical optimization.
Länkar:http://assets.cambridge.org/97805211/95270/cover/9780521195270.jpg

Internet

http://assets.cambridge.org/97805211/95270/cover/9780521195270.jpg

DCS

Beståndsuppgifter i DCS
Signum: 004.421 WIL
Exemplar Status otillgänglig

Liknande verk