| 書目名稱 | Combinatorial Optimization and Graph Algorithms |
| 副標題 | Communications of NI |
| 編輯 | Takuro Fukunaga,Ken-ichi Kawarabayashi |
| 視頻video | http://file.papertrans.cn/230/229983/229983.mp4 |
| 概述 | Discusses the very active area ranging from computer science and mathematics to operations research.Is based on the productive Shonan meetings on the topics dealt with in the book.Contains contributio |
| 圖書封面 |  |
| 描述 | .Covering network designs, discrete convex analysis, facility location and clustering problems, matching games, and parameterized complexity, this book discusses theoretical aspects of combinatorial optimization and graph algorithms. Contributions are by renowned researchers who attended NII Shonan meetings on this essential topic. The collection contained here provides readers with the outcome of the authors’ research and productive meetings on this dynamic area, ranging from computer science and mathematics to operations research...Networks are ubiquitous in today‘s world: the Web, online social networks, and search-and-query click logs can lead to a graph that consists of vertices and edges. Such networks are growing so fast that it is essential to design algorithms to work for these large networks. Graph algorithms comprise an area in computer science that works to design efficient algorithms for networks. Here one can work on theoretical or practical problems where implementation of an algorithm for large networks is needed. In two of the chapters, recent results in graph matching games and fixed parameter tractability are surveyed...Combinatorial optimization is an intersecti |
| 出版日期 | Book 2017 |
| 關鍵詞 | Graph Algorithm; Combinatorial Optimization; Approximation Algorithm; Polynomial Time; Network Design; Ti |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-981-10-6147-9 |
| isbn_softcover | 978-981-13-5581-3 |
| isbn_ebook | 978-981-10-6147-9 |
| copyright | Springer Nature Singapore Pte Ltd. 2017 |
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-16 22:57
發(fā)表于 2025-3-21 19:04:03
