Overview
- 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 work for further reading
- Ideal source of recent results that are not yet covered in other books
- Includes supplementary material: sn.pub/extras
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (14 chapters)
-
Front Matter
Keywords
About this book
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.
Reviews
Editors and Affiliations
About the editors
Martin Skutella is full professor in the Department of Mathematics at TU Berlin and member of the Research Center \textsc{Matheon}, “Mathematics for Key Technologies,” in Berlin. His main research interests lie in the area of efficient algorithms and combinatorial optimization, in particular in network optimization and scheduling. From 2009 to 2012, he was Editor-in-Chief of the Notices of the German Mathematical Society (DMV).
Sebastian Stiller is Professor for MathematicalOptimization at TU Braunschweig, Germany. His research interests include robust optimization, game theory, network flows, and scheduling, with applications mainly in traffic, transport, logistics, and real-time systems.
Dorothea Wagner heads the Institute of Theoretical Informatics at the Karlsruhe Institute of Technology. Her research interests are in the field of graph algorithms and algorithm engineering with a focus on traffic optimiza
tion, social network analysis and network visualization. She is currently a member of the German Council of Science and Humanities (Wissenschaftsrat) and served previously, for seven years as Vice President of the German Research Foundation (DFG).
Bibliographic Information
Book Title: Gems of Combinatorial Optimization and Graph Algorithms
Editors: Andreas S. Schulz, Martin Skutella, Sebastian Stiller, Dorothea Wagner
DOI: https://doi.org/10.1007/978-3-319-24971-1
Publisher: Springer Cham
eBook Packages: Mathematics and Statistics, Mathematics and Statistics (R0)
Copyright Information: Springer International Publishing Switzerland 2015
Hardcover ISBN: 978-3-319-24970-4Published: 18 January 2016
Softcover ISBN: 978-3-319-79711-3Published: 30 March 2018
eBook ISBN: 978-3-319-24971-1Published: 31 January 2016
Edition Number: 1
Number of Pages: X, 150
Number of Illustrations: 27 b/w illustrations, 24 illustrations in colour
Topics: Operations Research, Management Science, Algorithms, Calculus of Variations and Optimal Control; Optimization, Game Theory, Economics, Social and Behav. Sciences, Convex and Discrete Geometry, Combinatorics