Invitation fixed parameter algorithms di niedermeier rolf (21 risultati)

Lingua: Inglese
Editore: Oxford University Press, 2006
Serie: Libro 9 di 16 - Oxford Lecture Series in Mathematics and Its Applications
- Rilegato
Da: Anybook.com, Lincoln, Regno UnitoAnybook.com
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Buono
EUR 105,16
EUR 38,41 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibile
Condizione: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In good all round condition. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,650grams, ISBN:9780198566076. …

Lingua: Inglese
Editore: Oxford University Press, 2006
Serie: Libro 9 di 16 - Oxford Lecture Series in Mathematics and Its Applications
- Rilegato
Da: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 205,31
EUR 2,40 spedizioneSpedito in U.S.A.Quantità: Più di 20 disponibili
Condizione: New.

Lingua: Inglese
Editore: Oxford University Press, 2006
Serie: Libro 9 di 16 - Oxford Lecture Series in Mathematics and Its Applications
- Rilegato
Da: GreatBookPricesUK, Woodford Green, Regno UnitoGreatBookPricesUK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 203,41
EUR 18,02 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: New.

Lingua: Inglese
Editore: OXFORD UNIV PR, 2006
Serie: Libro 9 di 16 - Oxford Lecture Series in Mathematics and Its Applications
- Rilegato
Da: Buchpark, Trebbin, GermaniaBuchpark
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Ottimo
AffarePrezzo corrente: EUR 110,66
EUR 105,00 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Condizione: Sehr gut. Zustand: Sehr gut | Seiten: 312 | Sprache: Englisch | Produktart: Bücher | A fixed-parameter is an algorithm that provides an optimal solution to a combinatorial problem. This research-level text is an application-oriented introduction to the growing and highly topical area of the development and analysis of efficient fixed-parameter algorithms for hard problems. The book is divided into three parts: a broad introduction that provides the general philosophy and motivation; followed by coverage of algorithmic methods developed over the years in fixed-parameter algorithmics forming the core of the book; and a discussion of the essential from parameterizedhardness theory with a focus on W [1]-hardness, which parallels NP-hardness, then stating some relations to polynomial-time approximation algorithms, and finishing up with a list of selected case studies to show the wide range of applicability of the presented methodology. Aimed at graduate and research mathematicians, programmers, algorithm designers and computer scientists, the book introduces the basic techniques and results and provides a fresh view on this highly innovative field of algorithmic research.…

Lingua: Inglese
Editore: Oxford University Press, 2006
Serie: Libro 9 di 16 - Oxford Lecture Series in Mathematics and Its Applications
- Rilegato
Da: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Come nuovo
EUR 233,06
EUR 2,40 spedizioneSpedito in U.S.A.Quantità: Più di 20 disponibili
Condizione: As New. Unread book in perfect condition.

Lingua: Inglese
Editore: Oxford University Press, 2006
Serie: Libro 9 di 16 - Oxford Lecture Series in Mathematics and Its Applications
- Rilegato
Da: GreatBookPricesUK, Woodford Green, Regno UnitoGreatBookPricesUK
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Come nuovo
EUR 239,54
EUR 18,02 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: As New. Unread book in perfect condition.

Invitation to Fixed Parameter Algorithms (Oxford Lecture Series in Mathematics and Its Applications)
Lingua: Inglese
Editore: Oxford University Press, 2006
Serie: Libro 9 di 16 - Oxford Lecture Series in Mathematics and Its Applications
- Rilegato
Da: Ria Christie Collections, Uxbridge, Regno UnitoRia Christie Collections
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 245,86
EUR 13,47 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. In English.

Lingua: Inglese
Editore: OUP Oxford, 2006
Serie: Libro 9 di 16 - Oxford Lecture Series in Mathematics and Its Applications
- Rilegato
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrlandaKennys Bookshop and Art Galleries Ltd.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 249,06
EUR 9,50 spedizioneSpedito da Irlanda a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. An application-oriented introduction to the highly topical area of the development and analysis of efficient fixed-parameter algorithms for hard problems. Aimed at graduate and research mathematicians, algorithm designers, and computer scientists, it provides a fresh view on this highly innovative field of algorithmic research. Series: Oxford Lecture Series in Mathematics & Its Applications. Num Pages: 316 pages, 25 line figures. BIC Classification: PBKS. Category: (P) Professional & Vocational. Dimension: 241 x 165 x 24. Weight in Grams: 608. . 2006. Illustrated. hardcover. . . . .…

Lingua: Inglese
Editore: OUP Oxford, 2006
Serie: Libro 9 di 16 - Oxford Lecture Series in Mathematics and Its Applications
- Rilegato
Da: Home-set, Mannheim, GermaniaHome-set
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 252,38
EUR 49,90 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Gebundene Ausgabe. Condizione: Neu. This research-level text is an application-oriented introduction to the growing and highly topical area of the development and analysis of efficient fixed-parameter algorithms for optimally solving computationally hard combinatorial problems. The book is divided into three parts: a broad introduction that provides the general philosophy and motivation; followed by coverage of algorithmic methods developed over the years in fixed-parameter algorithmics forming the core of the book; and a discussion of the essentials from parameterized hardness theory with a focus on W[1]-hardness which parallels NP-hardness, then stating some relations to polynomial-time approximation algorithms, and finishing up with a list of selected case studies to show the wide range of applicability of the presented methodology. Aimed at graduate and research mathematicians, programmers, algorithm designers, and computer scientists, the book introduces the basic techniques and results and provides a fresh view on this highly innovative field of algorithmic research. Sprache: Englisch Gewicht in Gramm: 590.…

Lingua: Inglese
Editore: OUP Oxford, 2006
Serie: Libro 9 di 16 - Oxford Lecture Series in Mathematics and Its Applications
- Rilegato
Da: Kennys Bookstore, Olney, MD, U.S.A.Kennys Bookstore
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 316,90
EUR 9,55 spedizioneSpedito in U.S.A.Quantità: Più di 20 disponibili
Condizione: New. An application-oriented introduction to the highly topical area of the development and analysis of efficient fixed-parameter algorithms for hard problems. Aimed at graduate and research mathematicians, algorithm designers, and computer scientists, it provides a fresh view on this highly innovative field of algorithmic research. Series: Oxford Lecture Series in Mathematics & Its Applications. Num Pages: 316 pages, 25 line figures. BIC Classification: PBKS. Category: (P) Professional & Vocational. Dimension: 241 x 165 x 24. Weight in Grams: 608. . 2006. Illustrated. hardcover. . . . . Books ship from the US and Ireland.…

Lingua: Inglese
Editore: Oxford University Press, Oxford, 2006
Serie: Libro 9 di 16 - Oxford Lecture Series in Mathematics and Its Applications
- Rilegato
- Print on Demand
Da: AussieBookSeller, Truganina, VIC, AustraliaAussieBookSeller
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 129,97
EUR 33,66 spedizioneSpedito da Australia a U.S.A.Quantità: 1 disponibile
Hardcover. Condizione: new. Hardcover. This research-level text is an application-oriented introduction to the growing and highly topical area of the development and analysis of efficient fixed-parameter algorithms for optimally solving computationally hard combinatorial problems.The book is divided into three parts: a broad introduction that provides the general philosophy and motivation; followed by coverage of algorithmic methods developed over the years in fixed-parameteralgorithmics forming the core of the book; and a discussion of the essentials from parameterized hardness theory with a focus on W[1]-hardness which parallels NP-hardness, then stating some relations topolynomial-time approximation algorithms, and finishing up with a list of selected case studies to show the wide range of applicability of the presented methodology.Aimed at graduate and research mathematicians, programmers, algorithm designers, and computer scientists, the book introduces the basic techniques and results and provides a fresh view on this highly innovative field of algorithmic research. An application-oriented introduction to the highly topical area of the development and analysis of efficient fixed-parameter algorithms for hard problems. Aimed at graduate and research mathematicians, algorithm designers, and computer scientists, it provides a fresh view on this highly innovative field of algorithmic research. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.…

Lingua: Inglese
Editore: Oxford University Press, 2006
Serie: Libro 9 di 16 - Oxford Lecture Series in Mathematics and Its Applications
- Rilegato
- Print on Demand
Da: Brook Bookstore On Demand, Napoli, NA, ItaliaBrook Bookstore On Demand
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 188,82
EUR 6,80 spedizioneSpedito da Italia a U.S.A.Quantità: Più di 20 disponibili
Condizione: new. Questo è un articolo print on demand.

Lingua: Inglese
Editore: OUP Oxford, 2006
Serie: Libro 9 di 16 - Oxford Lecture Series in Mathematics and Its Applications
- Rilegato
- Print on Demand
Da: PBShop.store UK, Fairford, GLOS, Regno UnitoPBShop.store UK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 227,23
EUR 6,03 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
HRD. Condizione: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

Lingua: Inglese
Editore: OUP Oxford, 2006
Serie: Libro 9 di 16 - Oxford Lecture Series in Mathematics and Its Applications
- Rilegato
- Print on Demand
Da: PBShop.store US, Wood Dale, IL, U.S.A.PBShop.store US
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 237,20
Spedizione gratuitaSpedito in U.S.A.Quantità: Più di 20 disponibili
HRD. Condizione: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

Lingua: Inglese
Editore: Oxford University Press, Oxford, 2006
Serie: Libro 9 di 16 - Oxford Lecture Series in Mathematics and Its Applications
- Rilegato
- Print on Demand
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.Grand Eagle Retail
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 240,79
Spedizione gratuitaSpedito in U.S.A.Quantità: 1 disponibile
Hardcover. Condizione: new. Hardcover. This research-level text is an application-oriented introduction to the growing and highly topical area of the development and analysis of efficient fixed-parameter algorithms for optimally solving computationally hard combinatorial problems.The book is divided into three parts: a broad introduction that provides the general philosophy and motivation; followed by coverage of algorithmic methods developed over the years in fixed-parameteralgorithmics forming the core of the book; and a discussion of the essentials from parameterized hardness theory with a focus on W[1]-hardness which parallels NP-hardness, then stating some relations topolynomial-time approximation algorithms, and finishing up with a list of selected case studies to show the wide range of applicability of the presented methodology.Aimed at graduate and research mathematicians, programmers, algorithm designers, and computer scientists, the book introduces the basic techniques and results and provides a fresh view on this highly innovative field of algorithmic research. An application-oriented introduction to the highly topical area of the development and analysis of efficient fixed-parameter algorithms for hard problems. Aimed at graduate and research mathematicians, algorithm designers, and computer scientists, it provides a fresh view on this highly innovative field of algorithmic research. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.…

Lingua: Inglese
Editore: Oxford University Press, Oxford, 2006
Serie: Libro 9 di 16 - Oxford Lecture Series in Mathematics and Its Applications
- Rilegato
- Print on Demand
Da: CitiRetail, Stevenage, Regno UnitoCitiRetail
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 238,15
EUR 44,44 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibile
Hardcover. Condizione: new. Hardcover. This research-level text is an application-oriented introduction to the growing and highly topical area of the development and analysis of efficient fixed-parameter algorithms for optimally solving computationally hard combinatorial problems.The book is divided into three parts: a broad introduction that provides the general philosophy and motivation; followed by coverage of algorithmic methods developed over the years in fixed-parameteralgorithmics forming the core of the book; and a discussion of the essentials from parameterized hardness theory with a focus on W[1]-hardness which parallels NP-hardness, then stating some relations topolynomial-time approximation algorithms, and finishing up with a list of selected case studies to show the wide range of applicability of the presented methodology.Aimed at graduate and research mathematicians, programmers, algorithm designers, and computer scientists, the book introduces the basic techniques and results and provides a fresh view on this highly innovative field of algorithmic research. An application-oriented introduction to the highly topical area of the development and analysis of efficient fixed-parameter algorithms for hard problems. Aimed at graduate and research mathematicians, algorithm designers, and computer scientists, it provides a fresh view on this highly innovative field of algorithmic research. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.…
Altre immaginiLingua: Inglese
Editore: OUP Oxford, 2006
Serie: Libro 9 di 16 - Oxford Lecture Series in Mathematics and Its Applications
- Rilegato
- Print on Demand
Da: preigu, Osnabrück, Germaniapreigu
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 216,75
EUR 70,00 spedizioneSpedito da Germania a U.S.A.Quantità: 5 disponibili
Buch. Condizione: Neu. Invitation to Fixed Parameter Algorithms | Rolf Niedermeier | Buch | Gebunden | Englisch | 2006 | OUP Oxford | EAN 9780198566076 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.

Lingua: Inglese
Editore: OUP Oxford, 2006
Serie: Libro 9 di 16 - Oxford Lecture Series in Mathematics and Its Applications
- Rilegato
- Print on Demand
Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 280,95
EUR 35,00 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Buch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This research-level text is an application-oriented introduction to the growing and highly topical area of the development and analysis of efficient fixed-parameter algorithms for optimally solving computationally hard combinatorial problems.The book is divided into three parts: a broad introduction that provides the general philosophy and motivation; followed by coverage of algorithmic methods developed over the years in fixed-parameter algorithmics forming the core of the book; and a discussion of the essentials from parameterized hardness theory with a focus on W[1]-hardness which parallels NP-hardness, then stating some relations to polynomial-time approximation algorithms, and finishing up with a list of selected case studies to show the wide range of applicability of the presented methodology.Aimed at graduate and research mathematicians, programmers, algorithm designers, and computer scientists, the book introduces the basic techniques and results and provides a fresh view on this highly innovative field of algorithmic research.…

Lingua: Inglese
Editore: Oxford University Press OUP, 2006
Serie: Libro 9 di 16 - Oxford Lecture Series in Mathematics and Its Applications
- Rilegato
- Print on Demand
Da: Books Puddle, Woodside, NY, U.S.A.Books Puddle
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 323,96
EUR 3,63 spedizioneSpedito in U.S.A.Quantità: 4 disponibili
Condizione: New. Print on Demand pp. 316.

Lingua: Inglese
Editore: Oxford University Press, 2006
Serie: Libro 9 di 16 - Oxford Lecture Series in Mathematics and Its Applications
- Rilegato
- Print on Demand
Da: Majestic Books, Hounslow, Regno UnitoMajestic Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 340,52
EUR 7,81 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 4 disponibili
Condizione: New. Print on Demand pp. 316 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.

Lingua: Inglese
Editore: Oxford University Press, 2006
Serie: Libro 9 di 16 - Oxford Lecture Series in Mathematics and Its Applications
- Rilegato
- Print on Demand
Da: Biblios, frankfurt am main, HESSE, GermaniaBiblios
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 338,27
EUR 9,95 spedizioneSpedito da Germania a U.S.A.Quantità: 4 disponibili
Condizione: New. PRINT ON DEMAND pp. 316.