國立虎尾科技大學 |

Gems of Combinatorial Optimization and Graph Algorithms

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Gems of Combinatorial Optimization and Graph Algorithms / edited by Andreas S. Schulz, Martin Skutella, Sebastian Stiller, Dorothea Wagner.
其他作者:	Schulz, Andreas S.
面頁冊數:	X, 150 p. 51 illus., 24 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Operations research. -
電子資源:	https://doi.org/10.1007/978-3-319-24971-1
ISBN:	9783319249711

Gems of Combinatorial Optimization and Graph Algorithms
Gems of Combinatorial Optimization and Graph Algorithms [electronic resource] /edited by Andreas S. Schulz, Martin Skutella, Sebastian Stiller, Dorothea Wagner. - 1st ed. 2015. - X, 150 p. 51 illus., 24 illus. in color.online resource.

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.

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.

ISBN: 9783319249711

Standard No.: 10.1007/978-3-319-24971-1doiSubjects--Topical Terms:

573517
Operations research.

LC Class. No.: QA402-402.37

Dewey Class. No.: 519.6

Gems of Combinatorial Optimization and Graph Algorithms
LDR:03698nam a22004215i 4500 001 962137
003 DE-He213
005 20200705130507.0
007 cr nn 008mamaa
008 201211s2015 gw | s |||| 0|eng d
020 $a 9783319249711 $9 978-3-319-24971-1
024 7 $a 10.1007/978-3-319-24971-1 $2 doi
035 $a 978-3-319-24971-1
050 4 $a QA402-402.37
050 4 $a T57.6-57.97
072 7 $a KJT $2 bicssc
072 7 $a BUS049000 $2 bisacsh
072 7 $a KJT $2 thema
072 7 $a KJM $2 thema
082 0 4 $a 519.6 $2 23
245 1 0 $a Gems of Combinatorial Optimization and Graph Algorithms $h [electronic resource] / $c edited by Andreas S. Schulz, Martin Skutella, Sebastian Stiller, Dorothea Wagner.
250 $a 1st ed. 2015.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2015.
300 $a X, 150 p. 51 illus., 24 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
505 0 $a 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.
520 $a 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.
650 0 $a Operations research. $3 573517
650 0 $a Management science. $3 719678
650 0 $a Algorithms. $3 527865
650 0 $a Calculus of variations. $3 527927
650 0 $a Game theory. $3 556918
650 0 $a Convex geometry . $3 1255327
650 0 $a Discrete geometry. $3 672137
650 0 $a Combinatorics. $3 669353
650 1 4 $a Operations Research, Management Science. $3 785065
650 2 4 $a Calculus of Variations and Optimal Control; Optimization. $3 593942
650 2 4 $a Game Theory, Economics, Social and Behav. Sciences. $3 669497
650 2 4 $a Convex and Discrete Geometry. $3 672138
700 1 $a Schulz, Andreas S. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1070660
700 1 $a Skutella, Martin. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 678740
700 1 $a Stiller, Sebastian. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1256950
700 1 $a Wagner, Dorothea. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1256951
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319249704
776 0 8 $i Printed edition: $z 9783319249728
776 0 8 $i Printed edition: $z 9783319797113
856 4 0 $u https://doi.org/10.1007/978-3-319-24971-1
912 $a ZDB-2-SMA
912 $a ZDB-2-SXMS
950 $a Mathematics and Statistics (SpringerNature-11649)
950 $a Mathematics and Statistics (R0) (SpringerNature-43713)