Parameterized Algorithms
Cygan, Marek; Fomin, Fedor V.; Kowalik, ?ukasz; Lokshtanov, Daniel; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Micha?; Saurabh, Saket
ISBN 10: 3319357026 ISBN 13: 9783319357027
Editorial: Springer, 2016
Nuevos
Encuadernación de tapa blanda
Librería:
Best Price, Torrance, CA, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Vendedor de AbeBooks desde 30 de agosto de 2024
Este artículo en concreto ya no está disponible.
Descripción
Descripción:
SUPER FAST SHIPPING. N° de ref. del artículo 9783319357027
Sinopsis:
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.
Acerca del autor:
Dr. Marek Cygan is an assistant professor at the Institute of Informatics of the University of Warsaw, Poland. His research areas include fixed parameter tractability, approximation algorithms, and exact exponential algorithms.
Prof. Fedor V. Fomin is a professor of algorithms in the Dept. of Informatics of the University of Bergen, Norway. His research interests are largely in the areas of algorithms and combinatorics, in particular: parameterized complexity, algorithms, and kernelization; exact (exponential time) algorithms; graph algorithms, in particular algorithmic graph minors; graph coloring and different modifications; graph widths parameters (treewidth, branchwidth, clique-width, etc.); and pursuit-evasion and search problems.
Dr. Hab. Łukasz Kowalik is an associate professor at the Institute of Informatics of the University of Warsaw, Poland. His research areas include algorithms and graph theory, in particular approximation algorithms, exact algorithms for NP-hard problems, planar graphs, and graph coloring.
Dr. Daniel Lokshtanov is a junior faculty member of the Dept. of Informatics of the University of Bergen, Norway. His research focuses on algorithmic graph theory, and he is the project leader for BeHard, a research project on kernelization.
Dr. Dániel Marx is a senior research fellow at the Institute for Computer Science and Control (SZTAKI) of the Hungarian Academy of Sciences, Budapest, Hungary. His research areas include discrete algorithms, parameterized complexity, and graph theory.
Dr. Marcin Pilipczuk is a postdoctoral researcher at the Institute of Informatics of the University of Warsaw, Poland. His research focuses on algorithmics, especially fixed parameter tractability and exact computations of NP-hard problems.
Dr. Michał Pilipczuk is a postdoctoral researcher at the Institute of Informatics of the University of Warsaw, Poland. His research areas include parameterized complexity, moderately exponential-time algorithms, and kernelization.
Prof. Saket Saurabh is a member of the Theoretical Computer Science (TCS) group of The Institute of Mathematical Sciences (CIT Campus) in Chennai, India. His research interests include algorithms and graph theory, in particular, parameterized and exact algorithms.
"Sobre este título" puede pertenecer a otra edición de este libro.
Detalles bibliográficos
Título: Parameterized Algorithms
Editorial: Springer
Año de publicación: 2016
Encuadernación: Encuadernación de tapa blanda
Condición: New
Los mejores resultados en AbeBooks
Imagen del vendedor
Parameterized Algorithms
Publicado por
Springer International Publishing, 2016
ISBN 10: 3319357026
ISBN 13: 9783319357027
Nuevo
Kartoniert / Broschiert
Librería: moluna, Greven, Alemania
Calificación del vendedor: 4 de 5 estrellas
Kartoniert / Broschiert. Condición: 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. Nº de ref. del artículo: 448746962
Comprar nuevo
EUR 47,23
Gastos de envío:
EUR 48,99
De Alemania a Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Parameterized Algorithms
Librería: preigu, Osnabrück, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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. Nº de ref. del artículo: 107671820
Comprar nuevo
EUR 49,15
Gastos de envío:
EUR 70,00
De Alemania a Estados Unidos de America
Cantidad disponible: 5 disponibles
Imagen de archivo
Parameterized Algorithms
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: ABLIING23Mar3113020094619
Comprar nuevo
EUR 53,44
Gastos de envío:
EUR 3,43
A Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Parameterized Algorithms
Publicado por
Springer International Publishing, 2016
ISBN 10: 3319357026
ISBN 13: 9783319357027
Nuevo
Taschenbuch
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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. Nº de ref. del artículo: 9783319357027
Comprar nuevo
EUR 53,49
Gastos de envío:
EUR 64,72
De Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen del vendedor
Parameterized Algorithms
Publicado por
Springer International Publishing Okt 2016, 2016
ISBN 10: 3319357026
ISBN 13: 9783319357027
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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 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. 632 pp. Englisch. Nº de ref. del artículo: 9783319357027
Comprar nuevo
EUR 53,49
Gastos de envío:
EUR 23,00
De Alemania a Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen del vendedor
Parameterized Algorithms
Publicado por
Springer International Publishing, Springer International Publishing Okt 2016, 2016
ISBN 10: 3319357026
ISBN 13: 9783319357027
Nuevo
Taschenbuch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. 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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 632 pp. Englisch. Nº de ref. del artículo: 9783319357027
Comprar nuevo
EUR 53,49
Gastos de envío:
EUR 60,00
De Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen del vendedor
Parameterized Algorithms
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: 28156732-n
Comprar nuevo
EUR 54,63
Gastos de envío:
EUR 2,27
A Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Parameterized Algorithms
Librería: Chiron Media, Wallingford, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
PF. Condición: New. Nº de ref. del artículo: 6666-IUK-9783319357027
Comprar nuevo
EUR 56,12
Gastos de envío:
EUR 17,56
De Reino Unido a Estados Unidos de America
Cantidad disponible: 10 disponibles
Imagen del vendedor
Parameterized Algorithms
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: 28156732-n
Comprar nuevo
EUR 57,36
Gastos de envío:
EUR 17,01
De Reino Unido a Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Parameterized Algorithms
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9783319357027_new
Comprar nuevo
EUR 57,37
Gastos de envío:
EUR 13,58
De Reino Unido a Estados Unidos de America
Cantidad disponible: Más de 20 disponibles