Gems of combinatorial optimization and graph algorithms [electronic resource] / Andreas S. Schulz, Martin Skutella, Sebastian Stiller, Dorothea Wagner, editors.
Schulz, Andreas S., editor.; Skutella, Martin (Mathematician), editor.; Stiller, Sebastian, editor.; Wagner, Dorothea, 1957- editor.
2015
QA402.5
Available Online

Linked e-resources

Linked Resource
Online Access
Concurrent users
Unlimited
Authorized users
Authorized users
Document Delivery Supplied
Can lend chapters, not whole ebooks

Details

Title
Gems of combinatorial optimization and graph algorithms [electronic resource] / Andreas S. Schulz, Martin Skutella, Sebastian Stiller, Dorothea Wagner, editors.
ISBN
9783319249711 electronic book
3319249711 electronic book
9783319249704
DOI
https://doi.org/10.1007/978-3-319-24971-1
Published
Cham : Springer, 2015.
Language
English
Description
1 online resource (x, 150 pages) : illustrations.
Item Number
10.1007/978-3-319-24971-1 doi
Call Number
QA402.5
Dewey Decimal Classification
519.6/4
Summary
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 beautiful mathematical and algorithmic results, ideas, proofs, concepts, and techniques in discrete mathematics and theoretical computer science? Gems of Combinatorial Optimization and Graph Algorithms is a handpicked collection of up-to-date articles, carefully prepared by a select group of international experts, who have contributed some of their most mathematically or algorithmically elegant ideas. Topics include longest tours and Steiner trees in geometric spaces, cartograms, resource buying games, congestion games, selfish routing, revenue equivalence and shortest paths, scheduling, linear structures in graphs, contraction hierarchies, budgeted matching problems, and motifs in networks. This volume is aimed at readers with some familiarity of combinatorial optimization, and appeals to researchers, graduate students, and advanced undergraduate students alike.
Access Note
Access limited to authorized users.
Source of Description
Online resource; title from PDF title page (SpringerLink, viewed February 3, 2016).
Added Author
Schulz, Andreas S., editor.
Skutella, Martin (Mathematician), editor.
Stiller, Sebastian, editor.
Wagner, Dorothea, 1957- editor.
Linked Resources
Online Access
Record Appears in
Online Resources > Ebooks
All Resources
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.

Browse Subjects

Show more subjects...

Statistics

from
to
Export