Hugendubel.info - Die B2B Online-Buchhandlung 

Merkliste
Die Merkliste ist leer.
Bitte warten - die Druckansicht der Seite wird vorbereitet.
Der Druckdialog öffnet sich, sobald die Seite vollständig geladen wurde.
Sollte die Druckvorschau unvollständig sein, bitte schliessen und "Erneut drucken" wählen.

Gems of Combinatorial Optimization and Graph Algorithms

Previously published in hardcover
BuchKartoniert, Paperback
150 Seiten
Englisch
Springererschienen am30.03.2018Softcover reprint of the original 1st ed. 2015
Are you looking for new lectures for your course on algorithms, combinatorial optimization, or algorithmic game theory? This volume is aimed at readers with some familiarity of combinatorial optimization, and appeals to researchers, graduate students, and advanced undergraduate students alike.mehr
Verfügbare Formate
BuchKartoniert, Paperback
EUR69,54
BuchGebunden
EUR74,89

Produkt

KlappentextAre you looking for new lectures for your course on algorithms, combinatorial optimization, or algorithmic game theory? This volume is aimed at readers with some familiarity of combinatorial optimization, and appeals to researchers, graduate students, and advanced undergraduate students alike.
Details
ISBN/GTIN978-3-319-79711-3
ProduktartBuch
EinbandartKartoniert, Paperback
Verlag
Erscheinungsjahr2018
Erscheinungsdatum30.03.2018
AuflageSoftcover reprint of the original 1st ed. 2015
Seiten150 Seiten
SpracheEnglisch
Gewicht254 g
IllustrationenX, 150 p. 51 illus., 24 illus. in color.
Artikel-Nr.47601187

Inhalt/Kritik

Inhaltsverzeichnis
Shifting Segments to Optimality: Stefan Felsner.- Linear structure of graphs and the knotting graph: Ekkehard Köhler.- Finding Longest Geometric Tours: Sandor P. Fekete.- Generalized Hanan Grids for Geometric Steiner Trees in Uniform Orientation Metrics: Matthias Müller-Hannemann.- Budgeted Matching via the Gasoline Puzzle: Guido Schäfer.- Motifs in Networks: Karsten Weihe.- Graph Fill-In, Elimination Ordering, Nested Dissection and Contraction Hierarchies: Ben Strasser and Dorothea Wagner.- Shortest Path To Mechanism Design: Rudolf Müller and Marc Uetz.- Selfish Routing and Proportional: Resource Allocation: Andreas S. Schulz.- Resource Buying Games: Tobias Harks  and Britta Peis.- Linear, exponential, but nothing else - On pure Nash equilibria in congestion games and priority rules for single-machine scheduling: Max Klimm.- Convex quadratic programming in scheduling:  Martin Skutella.- Robustness and approximation for universal sequencing: Nicole Megow.- A Short Note onLong Waiting Lists: Sebastian Stiller.mehr
Kritik
"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)mehr

Schlagworte

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





Weitere Artikel von
Herausgegeben:Schulz, Andreas S.