Dismissed site: www.nada.kth.se
NADA upphörde organisatoriskt 2005. Enheter och avdelningar relaterade till dess verksamhet ingår i Skolan för elektroteknik och datavetenskap vid KTH. Läs om skolan på KTH:s webbplats: https://www.kth.se/eecs NADA has not existed since 2005. Units and divisions related to NADA are a part of the School of Electrical Engineering and Computer Science at KTH Royal Institute of Technology. Read about
A compendium of NP optimization problems
Magnús Halldórsson Graph Theory: Covering and Partitioning, Subgraphs and Supergraphs, Sets and Partitions. Marek Karpinski Graph Theory: Vertex Ordering, Network Design: Cuts and Connectivity. Gerhard Woeginger Sequencing and Scheduling. This compendium of approximability results for NP optimization problems was last updated in 2000. The compendium is also a part of the book Complexity and Approx
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
処理を実行中です
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
