Sinossi
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 on Long Waiting Lists: Sebastian Stiller.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
