Coverart for item
The Resource Gems of Combinatorial Optimization and Graph Algorithms, edited by Andreas S. Schulz, Martin Skutella, Sebastian Stiller, Dorothea Wagner, (electronic resource)

Gems of Combinatorial Optimization and Graph Algorithms, edited by Andreas S. Schulz, Martin Skutella, Sebastian Stiller, Dorothea Wagner, (electronic resource)

Label
Gems of Combinatorial Optimization and Graph Algorithms
Title
Gems of Combinatorial Optimization and Graph Algorithms
Statement of responsibility
edited by Andreas S. Schulz, Martin Skutella, Sebastian Stiller, Dorothea Wagner
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--
Member of
Assigning source
Provided by Publisher
Image bit depth
0
Literary form
non fiction
http://library.link/vocab/relatedWorkOrContributorName
  • Schulz, Andreas S.
  • Skutella, Martin.
  • Stiller, Sebastian.
  • Wagner, Dorothea.
  • SpringerLink (Online service)
http://library.link/vocab/subjectName
  • Mathematics
  • Game theory
  • Algorithms
  • Convex geometry
  • Discrete geometry
  • Calculus of variations
  • Operations research
  • Management science
  • Combinatorics
Label
Gems of Combinatorial Optimization and Graph Algorithms, edited by Andreas S. Schulz, Martin Skutella, Sebastian Stiller, Dorothea Wagner, (electronic resource)
Link
http://ezproxy.eui.eu/login?url=http://dx.doi.org/10.1007/978-3-319-24971-1
Instantiates
Publication
Antecedent source
mixed
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier.
Color
not applicable
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
978-3-319-24971-1
Dimensions
unknown
Edition
1st ed. 2015.
Extent
X, 150 p. 51 illus., 24 illus. in color.
File format
multiple file formats
Form of item
electronic
Governing access note
Use of this electronic resource may be governed by a license agreement which restricts use to the European University Institute community. Each user is responsible for limiting use to individual, non-commercial purposes, without systematically downloading, distributing, or retaining substantial portions of information, provided that all copyright and other proprietary notices contained on the materials are retained. The use of software, including scripts, agents, or robots, is generally prohibited and may result in the loss of access to these resources for the entire European University Institute community
Isbn
9783319249711
Level of compression
uncompressed
Media category
computer
Media MARC source
rdamedia.
Media type code
  • c
Other control number
10.1007/978-3-319-24971-1
Other physical details
online resource.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
(OCoLC)1086521030
Label
Gems of Combinatorial Optimization and Graph Algorithms, edited by Andreas S. Schulz, Martin Skutella, Sebastian Stiller, Dorothea Wagner, (electronic resource)
Link
http://ezproxy.eui.eu/login?url=http://dx.doi.org/10.1007/978-3-319-24971-1
Publication
Antecedent source
mixed
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier.
Color
not applicable
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
978-3-319-24971-1
Dimensions
unknown
Edition
1st ed. 2015.
Extent
X, 150 p. 51 illus., 24 illus. in color.
File format
multiple file formats
Form of item
electronic
Governing access note
Use of this electronic resource may be governed by a license agreement which restricts use to the European University Institute community. Each user is responsible for limiting use to individual, non-commercial purposes, without systematically downloading, distributing, or retaining substantial portions of information, provided that all copyright and other proprietary notices contained on the materials are retained. The use of software, including scripts, agents, or robots, is generally prohibited and may result in the loss of access to these resources for the entire European University Institute community
Isbn
9783319249711
Level of compression
uncompressed
Media category
computer
Media MARC source
rdamedia.
Media type code
  • c
Other control number
10.1007/978-3-319-24971-1
Other physical details
online resource.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
(OCoLC)1086521030

Library Locations

    • Badia FiesolanaBorrow it
      Via dei Roccettini 9, San Domenico di Fiesole, 50014, IT
      43.803074 11.283055
Processing Feedback ...