The Library of Congress > Linked Data Service > BIBFRAME Works

Bibframe Work

Title
Gems of Combinatorial Optimization and Graph Algorithms
Type
Text
Monograph
Contribution
Schulz, Andreas S (editor)
Skutella, Martin (editor)
Stiller, Sebastian (editor)
Wagner, Dorothea (editor)
Subject
(BISACSH)
Algorithms (LCSH)
Calculus of variations (LCSH)
Combinatorial analysis (LCSH)
Convex geometry (LCSH)
Discrete geometry (LCSH)
Game theory (LCSH)
Management science (LCSH)
Operations research (LCSH)
Language
English (eng)
Classification
DDC: 519.6 full (Source: 23)
Content
text (txt)
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.
Table Of 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
Authorized Access Point
Gems of Combinatorial Optimization and Graph Algorithms
Admin Metadata
Status: new
Date: 2016-01-11
Admin Metadata
Status: changed
Date: 2020-11-25T13:20:18
Admin Metadata
Status: changed
Date: 2024-08-01T23:48:06.685-04:00
Admin Metadata
Encoding Level: preliminary
Identified By: bf:Local, 21818600
Description Language: English

other physical format
Gems of combinatorial optimization and graph algorithms
Gems of Combinatorial Optimization and Graph Algorithms
Gems of Combinatorial Optimization and Graph Algorithms
Gems of Combinatorial Optimization and Graph Algorithms
Printed edition
Gems of Combinatorial Optimization and Graph Algorithms
Gems of Combinatorial Optimization and Graph Algorithms
Gems of Combinatorial Optimization and Graph Algorithms