{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":28,"n_cols":5,"rows_kept":28,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[20,2,20,3],[21,2,21,3],[25,2,25,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910300251103321"]
[null,null,"Titolo",null,"Gems of combinatorial optimization and graph algorithms / / edited by Andreas S. Schulz, Martin Skutella, Sebastian Stiller, Dorothea Wagner"]
[null,null,"Pubbl/distr/stampa",null,"Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015"]
[null,null,"ISBN",null,"3-319-24971-1"]
[null,null,"Edizione",null,"[1st ed. 2015.]"]
[null,null,"Descrizione fisica",null,"1 online resource (153 p.)"]
[null,null,"Disciplina",null,"510"]
[null,null,"Soggetti",null,"Operations research"]
[{"$nulls":4},"Management science"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Calculus of variations"]
[{"$nulls":4},"Game theory"]
[{"$nulls":4},"Convex geometry"]
[{"$nulls":4},"Discrete geometry"]
[{"$nulls":4},"Combinatorial analysis"]
[{"$nulls":4},"Operations Research, Management Science"]
[{"$nulls":4},"Calculus of Variations and Optimal Control; Optimization"]
[{"$nulls":4},"Game Theory, Economics, Social and Behav. Sciences"]
[{"$nulls":4},"Convex and Discrete Geometry"]
[{"$nulls":4},"Combinatorics"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Description based upon print version of record."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references."]
[null,null,"Nota di contenuto",null,"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 "]
[{"$nulls":4},"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."]
[null,null,null,"Sommario/riassunto","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."]