EUR 50,10
Quantité disponible : 1 disponible(s)
Ajouter au panierhardcover. Etat : Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
EUR 62,26
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
EUR 64,79
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : As New. Unread book in perfect condition.
Langue: anglais
Edité par Springer International Publishing AG, CH, 2016
ISBN 10 : 3319357026 ISBN 13 : 9783319357027
Vendeur : Rarewaves.com USA, London, LONDO, Royaume-Uni
EUR 71,80
Quantité disponible : Plus de 20 disponibles
Ajouter au panierPaperback. Etat : New. Softcover reprint of the original 1st ed. 2015.
EUR 60,62
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
EUR 56,89
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
EUR 57,34
Quantité disponible : 10 disponible(s)
Ajouter au panierPF. Etat : New.
EUR 70,79
Quantité disponible : 1 disponible(s)
Ajouter au panierEtat : New. pp. 613.
EUR 66,74
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : As New. Unread book in perfect condition.
EUR 85,72
Quantité disponible : 1 disponible(s)
Ajouter au panierEtat : New. pp. 613.
EUR 73,87
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
EUR 78,95
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In English.
EUR 93,24
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Langue: anglais
Edité par Springer-Verlag New York Inc, 2016
ISBN 10 : 3319357026 ISBN 13 : 9783319357027
Vendeur : Revaluation Books, Exeter, Royaume-Uni
EUR 91,36
Quantité disponible : 2 disponible(s)
Ajouter au panierPaperback. Etat : Brand New. reprint edition. 632 pages. 9.25x6.10x1.34 inches. In Stock.
EUR 118,93
Quantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. pp. 620.
EUR 58,84
Quantité disponible : 1 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained guide to the area. The book covers many of the recent developments of the field, including application of important separators, branching based on linear programming, Cut & Count to obtain faster algorithms on tree decompositions, algorithms based on representative families of matroids, and use of the Strong Exponential Time Hypothesis. A number of older results are revisited and explained in a modern and didactic way.The book provides a toolbox of algorithmic techniques. Part I is an overview of basic techniques, each chapter discussing a certain algorithmic paradigm. The material covered in this part can be used for an introductory course on fixed-parameter tractability. Part II discusses more advanced and specialized algorithmic ideas, bringing the reader to the cutting edge of current research. Part III presentscomplexity results and lower bounds, giving negative evidence by way of W[1]-hardness, the Exponential Time Hypothesis, and kernelization lower bounds.All the results and concepts are introduced at a level accessible to graduate students and advanced undergraduate students. Every chapter is accompanied by exercises, many with hints, while the bibliographic notes point to original publications and related work.
EUR 54,80
Quantité disponible : 5 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. Parameterized Algorithms | Marek Cygan (u. a.) | Taschenbuch | xvii | Englisch | 2016 | Springer | EAN 9783319357027 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Langue: anglais
Edité par Springer International Publishing AG, CH, 2016
ISBN 10 : 3319357026 ISBN 13 : 9783319357027
Vendeur : Rarewaves.com UK, London, Royaume-Uni
EUR 67,01
Quantité disponible : Plus de 20 disponibles
Ajouter au panierPaperback. Etat : New. Softcover reprint of the original 1st ed. 2015.
Langue: anglais
Edité par Springer International Publishing, 2015
ISBN 10 : 3319212745 ISBN 13 : 9783319212746
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
EUR 73,39
Quantité disponible : 1 disponible(s)
Ajouter au panierGebundene Ausgabe. Etat : Sehr gut. Gebraucht - Sehr gut SG - leichte Beschädigungen oder Verschmutzungen, ungelesenes Mängelexemplar, gestempelt - This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained guide to the area. The book covers many of the recent developments of the field, including application of important separators, branching based on linear programming, Cut & Count to obtain faster algorithms on tree decompositions, algorithms based on representative families of matroids, and use of the Strong Exponential Time Hypothesis. A number of older results are revisited and explained in a modern and didactic way. The book provides a toolbox of algorithmic techniques. Part I is an overview of basic techniques, each chapter discussing a certain algorithmic paradigm. The material covered in this part can be used for an introductory course on fixed-parameter tractability. Part II discusses more advanced and specialized algorithmic ideas, bringing the reader to the cutting edge of current research. Part III presents complexity results and lower bounds, giving negative evidence by way of W[1]-hardness, the Exponential Time Hypothesis, and kernelization lower bounds. All the results and concepts are introduced at a level accessible to graduate students and advanced undergraduate students. Every chapter is accompanied by exercises, many with hints, while the bibliographic notes point to original publications and related work.
EUR 127,32
Quantité disponible : 2 disponible(s)
Ajouter au panierHardcover. Etat : Brand New. 632 pages. 9.50x6.50x1.50 inches. In Stock.
EUR 127,68
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : As New. Unread book in perfect condition.
EUR 118,14
Quantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : Like New. Like New. book.
EUR 80,24
Quantité disponible : 1 disponible(s)
Ajouter au panierBuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained guide to the area. The book covers many of the recent developments of the field, including application of important separators, branching based on linear programming, Cut & Count to obtain faster algorithms on tree decompositions, algorithms based on representative families of matroids, and use of the Strong Exponential Time Hypothesis. A number of older results are revisited and explained in a modern and didactic way.The book provides a toolbox of algorithmic techniques. Part I is an overview of basic techniques, each chapter discussing a certain algorithmic paradigm. The material covered in this part can be used for an introductory course on fixed-parameter tractability. Part II discusses more advanced and specialized algorithmic ideas, bringing the reader to the cutting edge of current research. Part III presentscomplexity results and lower bounds, giving negative evidence by way of W[1]-hardness, the Exponential Time Hypothesis, and kernelization lower bounds.All the results and concepts are introduced at a level accessible to graduate students and advanced undergraduate students. Every chapter is accompanied by exercises, many with hints, while the bibliographic notes point to original publications and related work.
EUR 149,16
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : As New. Unread book in perfect condition.
Vendeur : Brook Bookstore On Demand, Napoli, NA, Italie
EUR 50,23
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : new. Questo è un articolo print on demand.
Langue: anglais
Edité par Springer, Springer Okt 2016, 2016
ISBN 10 : 3319357026 ISBN 13 : 9783319357027
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
EUR 58,84
Quantité disponible : 2 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained guide to the area. The book covers many of the recent developments of the field, including application of important separators, branching based on linear programming, Cut & Count to obtain faster algorithms on tree decompositions, algorithms based on representative families of matroids, and use of the Strong Exponential Time Hypothesis. A number of older results are revisited and explained in a modern and didactic way.The book provides a toolbox of algorithmic techniques. Part I is an overview of basic techniques, each chapter discussing a certain algorithmic paradigm. The material covered in this part can be used for an introductory course on fixed-parameter tractability. Part II discusses more advanced and specialized algorithmic ideas, bringing the reader to the cutting edge of current research. Part III presentscomplexity results and lower bounds, giving negative evidence by way of W[1]-hardness, the Exponential Time Hypothesis, and kernelization lower bounds.All the results and concepts are introduced at a level accessible to graduate students and advanced undergraduate students. Every chapter is accompanied by exercises, many with hints, while the bibliographic notes point to original publications and related work. 632 pp. Englisch.
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
EUR 87,96
Quantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. PRINT ON DEMAND pp. 613.
Langue: anglais
Edité par Springer International Publishing, 2016
ISBN 10 : 3319357026 ISBN 13 : 9783319357027
Vendeur : moluna, Greven, Allemagne
EUR 51,51
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Authors are among the leading researchers in this fieldModern comprehensive explanation of recent tools and techniquesClass-tested content with exercises and suggested reading, suitable for graduate and advanced courses on algorithmsDr.
Langue: anglais
Edité par Springer, Springer Aug 2015, 2015
ISBN 10 : 3319212745 ISBN 13 : 9783319212746
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
EUR 80,24
Quantité disponible : 2 disponible(s)
Ajouter au panierBuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained guide to the area. The book covers many of the recent developments of the field, including application of important separators, branching based on linear programming, Cut & Count to obtain faster algorithms on tree decompositions, algorithms based on representative families of matroids, and use of the Strong Exponential Time Hypothesis. A number of older results are revisited and explained in a modern and didactic way.The book provides a toolbox of algorithmic techniques. Part I is an overview of basic techniques, each chapter discussing a certain algorithmic paradigm. The material covered in this part can be used for an introductory course on fixed-parameter tractability. Part II discusses more advanced and specialized algorithmic ideas, bringing the reader to the cutting edge of current research. Part III presentscomplexity results and lower bounds, giving negative evidence by way of W[1]-hardness, the Exponential Time Hypothesis, and kernelization lower bounds.All the results and concepts are introduced at a level accessible to graduate students and advanced undergraduate students. Every chapter is accompanied by exercises, many with hints, while the bibliographic notes point to original publications and related work. 632 pp. Englisch.
Langue: anglais
Edité par Springer International Publishing, 2015
ISBN 10 : 3319212745 ISBN 13 : 9783319212746
Vendeur : moluna, Greven, Allemagne
EUR 68,62
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Authors are among the leading researchers in this fieldModern comprehensive explanation of recent tools and techniquesClass-tested content with exercises and suggested reading, suitable for graduate and advanced courses on algorithmsAut.