Cargando…
Gems of Combinatorial Optimization and Graph Algorithms
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...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor Corporativo: | |
| Otros Autores: | , , , |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Cham :
Springer International Publishing : Imprint: Springer,
2015.
|
| Edición: | 1st ed. 2015. |
| Temas: | |
| Acceso en línea: | Texto Completo |
Tabla de Contenidos:
- 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.