ロード中...
The design of approximation algorithms /
"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...
第一著者: | |
---|---|
その他の著者: | |
フォーマット: | Printed Book |
言語: | English |
出版事項: |
New York :
Cambridge University Press,
2011.
|
主題: | |
オンライン・アクセス: | http://assets.cambridge.org/97805211/95270/cover/9780521195270.jpg |
インターネット
http://assets.cambridge.org/97805211/95270/cover/9780521195270.jpgDCS
請求記号: |
004.421 WIL |
---|---|
所蔵 | ステータス情報は利用できません |