Fr. 65.00

Parameterized and Exact Computation - 7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings

English · Paperback / Softback

Shipping usually within 1 to 2 weeks (title will be printed to order)

Description

Read more

This book constitutes the refereed proceedings of the 7th International Symposium on Parameterized and Exact Computation, IPEC 2012, in Ljubljana, Slovenia, in September 2012. The 21 revised full papers presented together with 2 keynote talks were carefully reviewed and selected from 37 submissions. The topics addressed cover research in all aspects of parameterized/exact algorithms and complexity including but are 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.

List of contents

Parameterized/exact algorithms and complexity.-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.-implementation issues of parameterized and exact algorithms.

Summary

This book constitutes the refereed proceedings of the 7th International Symposium on Parameterized and Exact Computation, IPEC 2012, in Ljubljana, Slovenia, in September 2012. The 21 revised full papers presented together with 2 keynote talks were carefully reviewed and selected from 37 submissions. The topics addressed cover research in all aspects of parameterized/exact algorithms and complexity including but are 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.

Product details

Assisted by J Woeginger (Editor), J Woeginger (Editor), Dimitrio M Thilikos (Editor), Dimitrios M Thilikos (Editor), Dimitrios M. Thilikos (Editor), Gerhard J. Woeginger (Editor), Gerhard J. Woeginger (Editor)
Publisher Springer, Berlin
 
Languages English
Product format Paperback / Softback
Released 09.08.2012
 
EAN 9783642332920
ISBN 978-3-642-33292-0
No. of pages 275
Dimensions 169 mm x 16 mm x 236 mm
Weight 441 g
Illustrations X, 275 p. 14 illus.
Series Lecture Notes in Computer Science
Theoretical Computer Science and General Issues
Lecture Notes in Computer Science / Theoretical Computer Science and General Issues
Lecture Notes in Computer Science
Theoretical Computer Science and General Issues
Subject Natural sciences, medicine, IT, technology > Mathematics > Probability theory, stochastic theory, mathematical statistics

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.