株式会社極東書店トップ ＞ 商品一覧 ＞ Gems of Combinatorial Optimization and Graph Algorithms. Softcover reprint of the original 1st ed. 2015
商品詳細
Gems of Combinatorial Optimization and Graph Algorithms. Softcover reprint of the original 1st ed. 2015
・ISBN 978-3-319-79711-3 paper EUR 64.99
￥17,371.- (税込) ※（※）価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
| 著者・編者 | Schulz, Andreas S. / Skutella, Martin / Stiller, Sebastian / Wagner, Dorothea (eds.), |
|---|---|
| 出版社 | (Springer International Publishing AG, SZ) |
| 出版年月 | 2018 |
| ページ数 | 150 pp. |
| 言語 | ENG |
| ニュース番号 | ＜A02-90220＞ |
解説
Are you looking for new lectures for your course on algorithms, combinatorial optimization, or algorithmic game theory? Maybe you need a convenient source of relevant, current topics for a graduate student or advanced undergraduate student seminar? Or perhaps you just want an enjoyable look at some beautiful mathematical and algorithmic results, ideas, proofs, concepts, and techniques in discrete mathematics and theoretical computer science?
Gems of Combinatorial Optimization and Graph Algorithms is a handpicked collection of up-to-date articles, carefully prepared by a select group of international experts, who have contributed some of their most mathematically or algorithmically elegant ideas. Topics include longest tours and Steiner trees in geometric spaces, cartograms, resource buying games, congestion games, selfish routing, revenue equivalence and shortest paths, scheduling, linear structures in graphs, contraction hierarchies, budgeted matching problems, and motifs in networks.
This volume is aimed at readers with some familiarity of combinatorial optimization, and appeals to researchers, graduate students, and advanced undergraduate students alike.