Gems of Combinatorial Optimization and Graph Algorithms

Edited by Andreas S. Schulz (), Martin Skutella (), Sebastian Stiller () and Dorothea Wagner ()

in Springer Books from Springer

Date: 2015
ISBN: 978-3-319-24971-1
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Chapters in this book:

Shifting Segments to Optimality

Stefan Felsner

Linear Structure of Graphs and the Knotting Graph

Ekkehard Köhler

Finding Longest Geometric Tours

Sándor 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

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

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprbok:978-3-319-24971-1

Ordering information: This item can be ordered from
http://www.springer.com/9783319249711

DOI: 10.1007/978-3-319-24971-1

Access Statistics for this book

More books in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().