『The Knapsack Problem and Fully Polynomial Time Approximation Schemes (FPTAS) Katherine Lai 18.434: Seminar in Theoretical Computer Science Prof. M. X. Goemans March 10, 2006 1 The Knapsack Problem In the knapsack problem, you are given a knapsack of size』へのコメント

[filetype:pdf][media:document]

KNAPSACK

khiroaki のブックマーク 2009/02/01 22:22

<blockquote class="hatena-bookmark-comment"><a class="comment-info" href="https://b.hatena.ne.jp/entry/13285485/comment/khiroaki" data-user-id="khiroaki" data-entry-url="https://b.hatena.ne.jp/entry/www-math.mit.edu/~goemans/18434/knapsack-katherine.pdf" data-original-href="http://www-math.mit.edu/~goemans/18434/knapsack-katherine.pdf" data-entry-favicon="https://cdn-ak2.favicon.st-hatena.com/64?url=http%3A%2F%2Fwww-math.mit.edu%2F~goemans%2F18434%2Fknapsack-katherine.pdf" data-user-icon="/users/khiroaki/profile.png">The Knapsack Problem and Fully Polynomial Time Approximation Schemes (FPTAS) Katherine Lai 18.434: Seminar in Theoretical Computer Science Prof. M. X. Goemans March 10, 2006 1 The Knapsack Problem In the knapsack problem, you are given a knapsack of size</a><ul class="comment-tag" style="list-style: none; margin: 0px;"><li style="float: left">[<a href="https://b.hatena.ne.jp/q/KNAPSACK">KNAPSACK</a>]</li></ul><br><p style="clear: left">[filetype:pdf][media:document]</p><a class="datetime" href="https://b.hatena.ne.jp/khiroaki/20090201#bookmark-13285485"><span class="datetime-body">2009/02/01 22:22</span></a></blockquote><script src="https://b.st-hatena.com/js/comment-widget.js" charset="utf-8" async></script>

このブックマークにはスターがありません。
最初のスターをつけてみよう！