| 書目名稱 | Gems of Combinatorial Optimization and Graph Algorithms | | 編輯 | Andreas S. Schulz,Martin Skutella,Dorothea Wagner | | 視頻video | http://file.papertrans.cn/382/381476/381476.mp4 | | 概述 | Some of the most beautiful results, concepts or algorithmic ideas from the authors‘ own research.Concise, easy to read, self-contained chapters, focussing on a well-defined topic.Pointers to related w | | 圖書封面 |  | | 描述 | .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.. | | 出版日期 | Book 2015 | | 關(guān)鍵詞 | Lectures in combinatorial optimization; Graph algorithms and network analysis; Advanced topics in disc | | 版次 | 1 | | doi | https://doi.org/10.1007/978-3-319-24971-1 | | isbn_softcover | 978-3-319-79711-3 | | isbn_ebook | 978-3-319-24971-1 | | copyright | Springer International Publishing Switzerland 2015 |
The information of publication is updating
|
|
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-13 15:09
發(fā)表于 2025-3-21 18:17:39
