Gems of Combinatorial Optimization and Graph Algorithms 2016
Afbeeldingen
Sla de afbeeldingen overArtikel vergelijken
- Engels
- Hardcover
- 9783319249704
- 18 januari 2016
- 150 pagina's
Samenvatting
Are you looking for new lectures for your course on algorithms, combinatorial optimization, or algorithmic game theory?
This volume is aimed at readers with some familiarity of combinatorial optimization, and appeals to researchers, graduate students, and advanced undergraduate students alike.
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.
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.
Productspecificaties
Inhoud
- Taal
- en
- Bindwijze
- Hardcover
- Oorspronkelijke releasedatum
- 18 januari 2016
- Aantal pagina's
- 150
- Illustraties
- Nee
Betrokkenen
- Hoofdredacteur
- Andreas S. Schulz
- Tweede Redacteur
- Martin Skutella
- Co Redacteur
- Dorothea Wagner
- Hoofduitgeverij
- Springer International Publishing Ag
Overige kenmerken
- Editie
- 1st ed. 2015
- Extra groot lettertype
- Nee
- Product breedte
- 164 mm
- Product hoogte
- 14 mm
- Product lengte
- 246 mm
- Studieboek
- Nee
- Verpakking breedte
- 155 mm
- Verpakking hoogte
- 235 mm
- Verpakking lengte
- 235 mm
- Verpakkingsgewicht
- 396 g
EAN
- EAN
- 9783319249704
Je vindt dit artikel in
- Categorieën
- Boek, ebook of luisterboek?
- Boek
- Taal
- Engels
- Beschikbaarheid
- Leverbaar
- Studieboek of algemeen
- Algemene boeken
Kies gewenste uitvoering
Prijsinformatie en bestellen
De prijs van dit product is 100 euro en 99 cent.- Prijs inclusief verzendkosten, verstuurd door bol
- Ophalen bij een bol afhaalpunt mogelijk
- 30 dagen bedenktijd en gratis retourneren
- Dag en nacht klantenservice
Rapporteer dit artikel
Je wilt melding doen van illegale inhoud over dit artikel:
- Ik wil melding doen als klant
- Ik wil melding doen als autoriteit of trusted flagger
- Ik wil melding doen als partner
- Ik wil melding doen als merkhouder
Geen klant, autoriteit, trusted flagger, merkhouder of partner? Gebruik dan onderstaande link om melding te doen.