Coverart for item
The Resource Gems of combinatorial optimization and graph algorithms, Andreas S. Schulz, Martin Skutella, Sebastian Stiller, Dorothea Wagner, editors

Gems of combinatorial optimization and graph algorithms, Andreas S. Schulz, Martin Skutella, Sebastian Stiller, Dorothea Wagner, editors

Label
Gems of combinatorial optimization and graph algorithms
Title
Gems of combinatorial optimization and graph algorithms
Statement of responsibility
Andreas S. Schulz, Martin Skutella, Sebastian Stiller, Dorothea Wagner, editors
Contributor
Editor
Subject
Language
eng
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
Cataloging source
UUM
Illustrations
illustrations
Index
no index present
Literary form
non fiction
Nature of contents
bibliography
http://library.link/vocab/relatedWorkOrContributorDate
1957-
http://library.link/vocab/relatedWorkOrContributorName
  • Schulz, Andreas S.
  • Skutella, Martin
  • Stiller, Sebastian
  • Wagner, Dorothea
http://library.link/vocab/subjectName
  • Combinatorial optimization
  • Graph algorithms
  • Combinatorial optimization
  • Graph algorithms
Label
Gems of combinatorial optimization and graph algorithms, Andreas S. Schulz, Martin Skutella, Sebastian Stiller, Dorothea Wagner, editors
Instantiates
Publication
Bibliography note
Includes bibliographical references
Carrier category
volume
Carrier category code
nc
Carrier MARC source
rdacarrier
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
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
Control code
942794638
Dimensions
25 cm
Extent
x, 150 pages
Isbn
9783319249704
Lccn
2015953249
Media category
unmediated
Media MARC source
rdamedia
Media type code
c
Other physical details
illustrations (some color)
System control number
(OCoLC)942794638
Label
Gems of combinatorial optimization and graph algorithms, Andreas S. Schulz, Martin Skutella, Sebastian Stiller, Dorothea Wagner, editors
Publication
Bibliography note
Includes bibliographical references
Carrier category
volume
Carrier category code
nc
Carrier MARC source
rdacarrier
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
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
Control code
942794638
Dimensions
25 cm
Extent
x, 150 pages
Isbn
9783319249704
Lccn
2015953249
Media category
unmediated
Media MARC source
rdamedia
Media type code
c
Other physical details
illustrations (some color)
System control number
(OCoLC)942794638

Library Locations

    • Mathematical Sciences LibraryBorrow it
      104 Ellis Library, Columbia, MO, 65201, US
      38.944377 -92.326537
Processing Feedback ...