Articoli correlati a Gems of Combinatorial Optimization and Graph Algorithms

Gems of Combinatorial Optimization and Graph Algorithms - Rilegato

 
9783319249704: Gems of Combinatorial Optimization and Graph Algorithms

Sinossi

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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Informazioni sull?autore

Andreas S. Schulz currently holds a chaired professorship at the Technische Universität München, where he has a joint appointment at the Center for Mathematics and the School of Management. Previously he was Head of the Operations Research and Statistics Group at the Sloan School of the Massachusetts Institute of Technology. His research interests span the theory and practice of mathematical optimization as well as computational economics and algorithmic game theory.


Martin Skutella is full professor in the Department of Mathematics at TU Berlin and member of the Research Center \textsc{Matheon}, “Mathematics for Key Technologies,” in Berlin. His main research interests lie in the area of efficient algorithms and combinatorial optimization, in particular in network optimization and scheduling. From 2009 to 2012, he was Editor-in-Chief of the Notices of the German Mathematical Society (DMV). 

Sebastian Stiller is Professor for Mathematical Optimization at TU Braunschweig, Germany. His research interests include robust optimization, game theory, network flows, and scheduling, with applications mainly in traffic, transport, logistics, and real-time systems. 

Dorothea Wagner heads the Institute of Theoretical Informatics at the Karlsruhe Institute of Technology.  Her research interests are in the field of graph algorithms and algorithm engineering with a focus on traffic optimiza
tion, social network analysis and network visualization.  She is currently a member of the German Council of Science and Humanities (Wissenschaftsrat) and served previously, for seven years as Vice President of the German Research Foundation (DFG).





Dalla quarta di copertina

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.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Compra usato

Condizioni: come nuovo
Unread book in perfect condition...
Visualizza questo articolo

EUR 17,02 per la spedizione da U.S.A. a Italia

Destinazione, tempi e costi

EUR 9,70 per la spedizione da Germania a Italia

Destinazione, tempi e costi

Altre edizioni note dello stesso titolo

9783319797113: Gems of Combinatorial Optimization and Graph Algorithms

Edizione in evidenza

ISBN 10:  3319797115 ISBN 13:  9783319797113
Casa editrice: Springer, 2018
Brossura

Risultati della ricerca per Gems of Combinatorial Optimization and Graph Algorithms

Immagini fornite dal venditore

Schulz, Andreas S.|Skutella, Martin|Stiller, Sebastian|Wagner, Dorothea
ISBN 10: 3319249703 ISBN 13: 9783319249704
Nuovo Rilegato
Print on Demand

Da: moluna, Greven, Germania

Valutazione del venditore 5 su 5 stelle 5 stelle, Maggiori informazioni sulle valutazioni dei venditori

Gebunden. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Some of the most beautiful results, concepts or algorithmic ideas from the authors own researchConcise, easy to read, self-contained chapters, focussing on a well-defined topicPointers to related work for furth. Codice articolo 74929374

Contatta il venditore

Compra nuovo

EUR 81,44
Convertire valuta
Spese di spedizione: EUR 9,70
Da: Germania a: Italia
Destinazione, tempi e costi

Quantità: Più di 20 disponibili

Aggiungi al carrello

Immagini fornite dal venditore

Andreas S. Schulz
ISBN 10: 3319249703 ISBN 13: 9783319249704
Nuovo Rilegato
Print on Demand

Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania

Valutazione del venditore 5 su 5 stelle 5 stelle, Maggiori informazioni sulle valutazioni dei venditori

Buch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 160 pp. Englisch. Codice articolo 9783319249704

Contatta il venditore

Compra nuovo

EUR 96,29
Convertire valuta
Spese di spedizione: EUR 11,00
Da: Germania a: Italia
Destinazione, tempi e costi

Quantità: 2 disponibili

Aggiungi al carrello

Immagini fornite dal venditore

Schulz, Andreas S. (EDT); Skutella, Martin (EDT); Stiller, Sebastian (EDT); Wagner, Dorothea (EDT)
Editore: Springer, 2016
ISBN 10: 3319249703 ISBN 13: 9783319249704
Antico o usato Rilegato

Da: GreatBookPrices, Columbia, MD, U.S.A.

Valutazione del venditore 5 su 5 stelle 5 stelle, Maggiori informazioni sulle valutazioni dei venditori

Condizione: As New. Unread book in perfect condition. Codice articolo 24711027

Contatta il venditore

Compra usato

EUR 91,90
Convertire valuta
Spese di spedizione: EUR 17,02
Da: U.S.A. a: Italia
Destinazione, tempi e costi

Quantità: Più di 20 disponibili

Aggiungi al carrello

Immagini fornite dal venditore

Schulz, Andreas S. (EDT); Skutella, Martin (EDT); Stiller, Sebastian (EDT); Wagner, Dorothea (EDT)
Editore: Springer, 2016
ISBN 10: 3319249703 ISBN 13: 9783319249704
Nuovo Rilegato

Da: GreatBookPrices, Columbia, MD, U.S.A.

Valutazione del venditore 5 su 5 stelle 5 stelle, Maggiori informazioni sulle valutazioni dei venditori

Condizione: New. Codice articolo 24711027-n

Contatta il venditore

Compra nuovo

EUR 94,20
Convertire valuta
Spese di spedizione: EUR 17,02
Da: U.S.A. a: Italia
Destinazione, tempi e costi

Quantità: Più di 20 disponibili

Aggiungi al carrello

Immagini fornite dal venditore

Andreas S. Schulz
ISBN 10: 3319249703 ISBN 13: 9783319249704
Nuovo Rilegato

Da: AHA-BUCH GmbH, Einbeck, Germania

Valutazione del venditore 5 su 5 stelle 5 stelle, Maggiori informazioni sulle valutazioni dei venditori

Buch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Codice articolo 9783319249704

Contatta il venditore

Compra nuovo

EUR 96,29
Convertire valuta
Spese di spedizione: EUR 14,99
Da: Germania a: Italia
Destinazione, tempi e costi

Quantità: 1 disponibili

Aggiungi al carrello

Immagini fornite dal venditore

Andreas S. Schulz
ISBN 10: 3319249703 ISBN 13: 9783319249704
Nuovo Rilegato

Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania

Valutazione del venditore 5 su 5 stelle 5 stelle, Maggiori informazioni sulle valutazioni dei venditori

Buch. Condizione: Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 160 pp. Englisch. Codice articolo 9783319249704

Contatta il venditore

Compra nuovo

EUR 96,29
Convertire valuta
Spese di spedizione: EUR 15,00
Da: Germania a: Italia
Destinazione, tempi e costi

Quantità: 2 disponibili

Aggiungi al carrello

Foto dell'editore

Schulz
Editore: Springer, 2016
ISBN 10: 3319249703 ISBN 13: 9783319249704
Nuovo Rilegato

Da: Ria Christie Collections, Uxbridge, Regno Unito

Valutazione del venditore 5 su 5 stelle 5 stelle, Maggiori informazioni sulle valutazioni dei venditori

Condizione: New. In. Codice articolo ria9783319249704_new

Contatta il venditore

Compra nuovo

EUR 102,82
Convertire valuta
Spese di spedizione: EUR 10,29
Da: Regno Unito a: Italia
Destinazione, tempi e costi

Quantità: Più di 20 disponibili

Aggiungi al carrello

Immagini fornite dal venditore

Schulz, Andreas S. (EDT); Skutella, Martin (EDT); Stiller, Sebastian (EDT); Wagner, Dorothea (EDT)
Editore: Springer, 2016
ISBN 10: 3319249703 ISBN 13: 9783319249704
Nuovo Rilegato

Da: GreatBookPricesUK, Woodford Green, Regno Unito

Valutazione del venditore 5 su 5 stelle 5 stelle, Maggiori informazioni sulle valutazioni dei venditori

Condizione: New. Codice articolo 24711027-n

Contatta il venditore

Compra nuovo

EUR 102,81
Convertire valuta
Spese di spedizione: EUR 17,17
Da: Regno Unito a: Italia
Destinazione, tempi e costi

Quantità: Più di 20 disponibili

Aggiungi al carrello

Foto dell'editore

Schulz
Editore: Springer, 2016
ISBN 10: 3319249703 ISBN 13: 9783319249704
Nuovo Rilegato

Da: California Books, Miami, FL, U.S.A.

Valutazione del venditore 5 su 5 stelle 5 stelle, Maggiori informazioni sulle valutazioni dei venditori

Condizione: New. Codice articolo I-9783319249704

Contatta il venditore

Compra nuovo

EUR 114,87
Convertire valuta
Spese di spedizione: EUR 7,66
Da: U.S.A. a: Italia
Destinazione, tempi e costi

Quantità: Più di 20 disponibili

Aggiungi al carrello

Foto dell'editore

Schulz
Editore: Springer, 2016
ISBN 10: 3319249703 ISBN 13: 9783319249704
Nuovo Rilegato

Da: Books Puddle, New York, NY, U.S.A.

Valutazione del venditore 4 su 5 stelle 4 stelle, Maggiori informazioni sulle valutazioni dei venditori

Condizione: New. pp. Codice articolo 26372786212

Contatta il venditore

Compra nuovo

EUR 118,62
Convertire valuta
Spese di spedizione: EUR 7,66
Da: U.S.A. a: Italia
Destinazione, tempi e costi

Quantità: 4 disponibili

Aggiungi al carrello

Vedi altre 5 copie di questo libro

Vedi tutti i risultati per questo libro