Gems of Combinatorial Optimization and Graph Algorithms

Gems of Combinatorial Optimization and Graph Algorithms

Wagner, Dorothea; Skutella, Martin; Stiller, Sebastian; Schulz, Andreas S.

Springer International Publishing AG

03/2018

150

Mole

Inglês

9783319797113

15 a 20 dias

454

Descrição não disponível.
Shifting Segments to Optimality: Stefan Felsner.- Linear structure of graphs and the knotting graph: Ekkehard Koehler.- Finding Longest Geometric Tours: Sandor P. Fekete.- Generalized Hanan Grids for Geometric Steiner Trees in Uniform Orientation Metrics: Matthias Mueller-Hannemann.- Budgeted Matching via the Gasoline Puzzle: Guido Schaefer.- 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 Mueller 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.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
Lectures in combinatorial optimization;Graph algorithms and network analysis;Advanced topics in discrete mathematics;Sequencing and scheduling;Algorithmic game theory;combinatorics