Parameterized and Exact Computation : 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers

Dániel Marx

ISBN 10: 3642280498 / ISBN 13: 9783642280498

Editore: Springer, Berlin, Springer Berlin Heidelberg, Springer, 2012

Riguardo questo articolo

Neuware - This book constitutes the thoroughly refereed post-conference proceedings of the 6th International Symposium on Parameterized and Exact Computation, IPEC 2011, in Saarbrücken, Germany, in September 2011. The 21 revised full papers presented were carefully reviewed and selected from 40 submissions. The topics addressed cover research in all aspects of parameterized and exact computation and complexity, including but not limited to new techniques for the design and analysis of parameterized and exact algorithms, fixed-parameter tractability results, parameterized complexity theory, relationship between parameterized complexity and traditional complexity classifications, applications of parameterized and exact computation, and implementation issues of parameterized and exact algorithms.

Codice articolo 9783642280498

Dati bibliografici

• Titolo: Parameterized and Exact Computation : 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers
• Editore: Springer, Berlin, Springer Berlin Heidelberg, Springer
• Data di pubblicazione: 2012
• Lingua: Inglese
• ISBN 10: 3642280498
• ISBN 13: 9783642280498
• Rilegatura: Taschenbuch
• Condizione: Neu

Descrizione articolo

Riassunto

This book constitutes the thoroughly refereed post-conference proceedings of the 6th International Symposium on Parameterized and Exact Computation, IPEC 2011, in Saarbrücken, Germany, in September 2011. The 21 revised full papers presented were carefully reviewed and selected from 40 submissions. The topics addressed cover research in all aspects of parameterized and exact computation and complexity, including but not limited to new techniques for the design and analysis of parameterized and exact algorithms, fixed-parameter tractability results, parameterized complexity theory, relationship between parameterized complexity and traditional complexity classifications, applications of parameterized and exact computation, and implementation issues of parameterized and exact algorithms.