Gems of Combinatorial Optimization and Graph Algorithms

Herausgeber: Schulz, A.S., Skutella, M., Stiller, S., Wagner, D. (Eds.)

  • 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
Weitere Vorteile

Dieses Buch kaufen

eBook 59,49 €
Preis für Deutschland (Brutto)
  • ISBN 978-3-319-24971-1
  • Versehen mit digitalem Wasserzeichen, DRM-frei
  • Erhältliche Formate: EPUB, PDF
  • eBooks sind auf allen Endgeräten nutzbar
  • Sofortiger eBook Download nach Kauf
Hardcover 74,89 €
Preis für Deutschland (Brutto)
  • ISBN 978-3-319-24970-4
  • Kostenfreier Versand für Individualkunden weltweit
  • Gewöhnlich versandfertig in 3-5 Werktagen.
Über dieses Buch

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.

Über den Autor

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 Mathematical Optimization 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 optimization, 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).





Stimmen zum Buch

“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)


Inhaltsverzeichnis (14 Kapitel)

  • Shifting Segments to Optimality

    Felsner, Stefan

    Seiten 1-12

  • Linear Structure of Graphs and the Knotting Graph

    Köhler, Ekkehard

    Seiten 13-27

  • Finding Longest Geometric Tours

    Fekete, Sándor P.

    Seiten 29-36

  • Generalized Hanan Grids for Geometric Steiner Trees in Uniform Orientation Metrics

    Müller-Hannemann, Matthias

    Seiten 37-47

  • Budgeted Matching via the Gasoline Puzzle

    Schäfer, Guido

    Seiten 49-57

Dieses Buch kaufen

eBook 59,49 €
Preis für Deutschland (Brutto)
  • ISBN 978-3-319-24971-1
  • Versehen mit digitalem Wasserzeichen, DRM-frei
  • Erhältliche Formate: EPUB, PDF
  • eBooks sind auf allen Endgeräten nutzbar
  • Sofortiger eBook Download nach Kauf
Hardcover 74,89 €
Preis für Deutschland (Brutto)
  • ISBN 978-3-319-24970-4
  • Kostenfreier Versand für Individualkunden weltweit
  • Gewöhnlich versandfertig in 3-5 Werktagen.
Loading...

Wir empfehlen

Loading...

Bibliografische Information

Bibliographic Information
Buchtitel
Gems of Combinatorial Optimization and Graph Algorithms
Herausgeber
  • Andreas S. Schulz
  • Martin Skutella
  • Sebastian Stiller
  • Dorothea Wagner
Copyright
2015
Verlag
Springer International Publishing
Copyright Inhaber
Springer International Publishing Switzerland
eBook ISBN
978-3-319-24971-1
DOI
10.1007/978-3-319-24971-1
Hardcover ISBN
978-3-319-24970-4
Auflage
1
Seitenzahl
X, 150
Anzahl der Bilder und Tabellen
27 schwarz-weiß Abbildungen, 24 Abbildungen in Farbe
Themen