Combinatorial Optimization and Graph Algorithms: Communications of Nii Shonan Meetings
暫譯: 組合優化與圖演算法：Nii Shonan 會議通訊

Fukunaga, Takuro, Kawarabayashi, Ken-Ichi

Combinatorial Optimization and Graph Algorithms: Communications of Nii Shonan Meetings
  • 出版商: Springer
  • 出版日期: 2018-12-11
  • 售價: $4,560
  • 貴賓價: 9.5 折 $4,332
  • 語言: 英文
  • 頁數: 120
  • 裝訂: Quality Paper - also called trade paper
  • ISBN: 9811355819
  • ISBN-13: 9789811355813
  • 相關分類: Algorithms-data-structures

    • 海外代購書籍(需單獨結帳)

相關主題

商品描述

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 intersection of operations research and mathematics, especially discrete mathematics, which deals with new questions and new problems, attempting to find an optimum object from a finite set of objects. Most problems in combinatorial optimization are not tractable (i.e., NP-hard). Therefore it is necessary to design an approximation algorithm for them. To tackle these problems requires the development and combination of ideas and techniques from diverse mathematical areas including complexity theory, algorithm theory, and matroids as well as graph theory, combinatorics, convex and nonlinear optimization, and discrete and convex geometry. Overall, the book presents recent progress in facility location, network design, and discrete convex analysis.

商品描述(中文翻譯)

本書涵蓋了網路設計、離散凸分析、設施位置與聚類問題、配對遊戲以及參數化複雜性，討論了組合優化和圖演算法的理論方面。貢獻者是參加 NII Shonan 會議的知名研究人員，這些會議專注於這一重要主題。本書所收錄的內容提供了作者在這一動態領域的研究成果和富有成效的會議，範圍涵蓋計算機科學、數學到運籌學。

在當今世界，網路無處不在：網際網路、線上社交網路以及搜尋和查詢點擊日誌可以形成由頂點和邊組成的圖。這些網路的增長速度非常快，因此設計能夠適用於這些大型網路的演算法變得至關重要。圖演算法是計算機科學的一個領域，致力於為網路設計高效的演算法。在這裡，可以針對需要為大型網路實現演算法的理論或實際問題進行研究。在兩個章節中，回顧了圖配對遊戲和固定參數可處理性方面的最新成果。

組合優化是運籌學和數學，特別是離散數學的交集，處理新的問題和新問題，試圖從有限的物件集合中找到最佳物件。大多數組合優化問題都是不可處理的（即 NP-hard）。因此，有必要為它們設計近似演算法。解決這些問題需要來自不同數學領域的思想和技術的發展與結合，包括複雜性理論、演算法理論、矩陣理論，以及圖論、組合學、凸與非線性優化、離散與凸幾何等。總體而言，本書展示了在設施位置、網路設計和離散凸分析方面的最新進展。

作者簡介

Takuro Fukunaga is currently a project associate professor at the National Institute of Informatics. After receiving a B.A. in engineering and an M.A. and Ph.D. in informatics from Kyoto University in 2003, 2005, and 2007, respectively, he was an assistant professor there until January 2013. He is a member of the Operations Research Society of Japan, the Information Processing Society of Japan, and IEEE.
Ken-ichi Kawarabayashi is a professor at the National Institute of Informatics. He received a B.A., M.A., and Ph.D. from Keio University in 1998, 2000, and 2001, respectively. The prizes he has been awarded include the IBM Japanese Science Prize, the JSPS Prize 2013, the Japan Academy Medal in 2013, the SODA best paper award in 2013, and the Mathematics Annual Spring Prize in 2015.

作者簡介(中文翻譯)

福永拓郎目前是國立資訊學研究所的專案副教授。他於2003年、2005年和2007年分別在京都大學獲得工程學學士、資訊學碩士及博士學位，並在該校擔任助理教授直到2013年1月。他是日本運籌學會、日本資訊處理學會及IEEE的成員。

河原林健一是國立資訊學研究所的教授。他於1998年、2000年和2001年分別在慶應義塾大學獲得學士、碩士及博士學位。他所獲得的獎項包括IBM日本科學獎、2013年JSPS獎、2013年日本學士院獎章、2013年SODA最佳論文獎，以及2015年數學年會春季獎。

類似商品