東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Gems of combinatorial optimization a...

Schulz, Andreas S.

FindBook

Google Book

Amazon

博客來

Gems of combinatorial optimization and graph algorithms

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Gems of combinatorial optimization and graph algorithms/ edited by Andreas S. Schulz ... [et al.].
其他作者:	Schulz, Andreas S.
出版者:	Cham :Springer International Publishing : : 2015.,
面頁冊數:	x, 150 p. :ill., digital ;24 cm.
內容註:	Shifting Segments to Optimality: Stefan Felsner -- Linear structure of graphs and the knotting graph: Ekkehard Kohler -- Finding Longest Geometric Tours: Sandor P. Fekete -- Generalized Hanan Grids for Geometric Steiner Trees in Uniform Orientation Metrics: Matthias Muller-Hannemann -- Budgeted Matching via the Gasoline Puzzle: Guido Schafer -- 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 Muller 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.
Contained By:	Springer eBooks
標題:	Combinatorial optimization. -
電子資源:	http://dx.doi.org/10.1007/978-3-319-24971-1
ISBN:	9783319249711$q(electronic bk.)

Gems of combinatorial optimization and graph algorithms
Gems of combinatorial optimization and graph algorithms[electronic resource] /edited by Andreas S. Schulz ... [et al.]. - Cham :Springer International Publishing :2015. - x, 150 p. :ill., digital ;24 cm.

Shifting Segments to Optimality: Stefan Felsner -- Linear structure of graphs and the knotting graph: Ekkehard Kohler -- Finding Longest Geometric Tours: Sandor P. Fekete -- Generalized Hanan Grids for Geometric Steiner Trees in Uniform Orientation Metrics: Matthias Muller-Hannemann -- Budgeted Matching via the Gasoline Puzzle: Guido Schafer -- 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 Muller 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.

ISBN: 9783319249711$q(electronic bk.)

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

544215
Combinatorial optimization.

LC Class. No.: QA402.5

Dewey Class. No.: 519.64

Gems of combinatorial optimization and graph algorithms
LDR:02039nmm a2200325 a 4500 001 2016638
003 DE-He213
005 20160526112959.0
006 m d
007 cr nn 008maaau
008 160613s2015 gw s 0 eng d
020 $a 9783319249711$q(electronic bk.)
020 $a 9783319249704$q(paper)
024 7 $a 10.1007/978-3-319-24971-1 $2 doi
035 $a 978-3-319-24971-1
040 $a GP $c GP
041 0 $a eng
050 4 $a QA402.5
072 7 $a KJT $2 bicssc
072 7 $a KJM $2 bicssc
072 7 $a BUS049000 $2 bisacsh
072 7 $a BUS042000 $2 bisacsh
082 0 4 $a 519.64 $2 23
090 $a QA402.5 $b .G323 2015
245 0 0 $a Gems of combinatorial optimization and graph algorithms $h [electronic resource] / $c edited by Andreas S. Schulz ... [et al.].
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2015.
300 $a x, 150 p. : $b ill., digital ; $c 24 cm.
505 0 $a Shifting Segments to Optimality: Stefan Felsner -- Linear structure of graphs and the knotting graph: Ekkehard Kohler -- Finding Longest Geometric Tours: Sandor P. Fekete -- Generalized Hanan Grids for Geometric Steiner Trees in Uniform Orientation Metrics: Matthias Muller-Hannemann -- Budgeted Matching via the Gasoline Puzzle: Guido Schafer -- 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 Muller 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.
650 0 $a Combinatorial optimization. $3 544215
650 0 $a Graph algorithms. $3 596326
650 1 4 $a Mathematics. $3 515831
650 2 4 $a Operations Research, Management Science. $3 1532996
650 2 4 $a Algorithms. $3 536374
650 2 4 $a Calculus of Variations and Optimal Control; Optimization. $3 898674
650 2 4 $a Game Theory, Economics, Social and Behav. Sciences. $3 891103
650 2 4 $a Convex and Discrete Geometry. $3 893686
650 2 4 $a Combinatorics. $3 895617
700 1 $a Schulz, Andreas S. $3 2088905
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-24971-1
950 $a Mathematics and Statistics (Springer-11649)