---

＜電子ブック＞
Gems of Combinatorial Optimization and Graph Algorithms / edited by Andreas S. Schulz, Martin Skutella, Sebastian Stiller, Dorothea Wagner

版	1st ed. 2015.
出版者	Cham : Springer International Publishing : Imprint: Springer
出版年	2015
本文言語	英語
大きさ	X, 150 p. 51 illus., 24 illus. in color : online resource
著者標目	Schulz, Andreas S editor Skutella, Martin editor Stiller, Sebastian editor Wagner, Dorothea editor SpringerLink (Online service)
件　名	LCSH:Operations research LCSH:Management science LCSH:Algorithms LCSH:Mathematical optimization LCSH:Calculus of variations LCSH:Game theory LCSH:Convex geometry  LCSH:Discrete geometry LCSH:Discrete mathematics FREE:Operations Research, Management Science FREE:Algorithms FREE:Calculus of Variations and Optimization FREE:Game Theory FREE:Convex and Discrete Geometry FREE:Discrete Mathematics
一般注記	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 onLong Waiting Lists: Sebastian Stiller 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 HTTP:URL=https://doi.org/10.1007/978-3-319-24971-1

 類似資料