Overview
- 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 contributions by renowned researchers in the field of combinatorial optimization and graph algorithms
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (5 chapters)
-
Front Matter
Keywords
About this book
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.
Editors and Affiliations
About the editors
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.
Bibliographic Information
Book Title: Combinatorial Optimization and Graph Algorithms
Book Subtitle: Communications of NII Shonan Meetings
Editors: Takuro Fukunaga, Ken-ichi Kawarabayashi
DOI: https://doi.org/10.1007/978-981-10-6147-9
Publisher: Springer Singapore
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer Nature Singapore Pte Ltd. 2017
Hardcover ISBN: 978-981-10-6146-2Published: 10 October 2017
Softcover ISBN: 978-981-13-5581-3Published: 11 December 2018
eBook ISBN: 978-981-10-6147-9Published: 02 October 2017
Edition Number: 1
Number of Pages: IX, 120
Number of Illustrations: 9 b/w illustrations, 2 illustrations in colour
Topics: Discrete Mathematics in Computer Science, Discrete Mathematics, Operations Research/Decision Theory