Skip to main content

Gems of Combinatorial Optimization and Graph Algorithms

  • Book
  • © 2015

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

This is a preview of subscription content, log in via an institution to check access.

Access this book

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook USD 54.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 99.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

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.

Similar content being viewed by others

Keywords

Table of contents (14 chapters)

Reviews

“Seventeen former advisees of Rolf H. Möhring contributed to this collection with fourteen short essays, on the occasion of his retirement. The result is a beautiful collection of results in combinatorial optimization, graph algorithms, algorithmic game theory and computational geometry, each suitable as a basis for a lecture or two in an advanced undergraduate or a graduate course. … Nice examples, high quality illustrations and suggestion for further reading at the end of each chapter make the book truly valuable.” (András Recski, Mathematical Reviews, October, 2016)

Editors and Affiliations

  • Technische Universität München, Munich, Germany

    Andreas S. Schulz

  • Institute of Mathematics, Technische Universität Berlin, Berlin, Germany

    Martin Skutella

  • Technische Universität Braunschweig, Braunschweig, Germany

    Sebastian Stiller

  • Institute of Theoretical Informatics, Karlsruher Institut für Technologie (KIT), Karlsruhe, Germany

    Dorothea Wagner

About the editors

Andreas S. Schulz currently holds a chaired professorship at the Technische Universität München, where he has a joint appointment at the Center for Mathematics and the School of Management. Previously he was Head of the Operations Research and Statistics Group at the Sloan School of the Massachusetts Institute of Technology. His research interests span the theory and practice of mathematical optimization as well as computational economics and algorithmic game theory.
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

Publish with us