Gems of Combinatorial Optimization and Graph Algorithms

by Andreas S. Schulz (editor)

Shifting Segments to Stefan Felsner.- Linear structure of graphs and the knotting Ekkehard Köhler.- Finding Longest Geometric Sandor P. Fekete.- Generalized Hanan Grids for Geometric Steiner Trees in Uniform Orientation Matthias Müller-Hannemann.- Budgeted Matching via the Gasoline Guido Schäfer.- Motifs in Karsten Weihe.- Graph Fill-In, Elimination Ordering, Nested Dissection and Contraction Ben Strasser and Dorothea Wagner.- Shortest Path To Mechanism Rudolf Müller and Marc Uetz.- Selfish Routing and Resource Andreas S. Schulz.- Resource Buying Tobias Harks and Britta Peis.- Linear, exponential, but nothing else - On pure Nash equilibria in congestion games and priority rules for single-machine Max Klimm.- Convex quadratic programming in Martin Skutella.- Robustness and approximation for universal Nicole Megow.- A Short Note on Long Waiting Sebastian Stiller.

162 pages, Paperback

First published December 25, 2015