Parameterized and Exact Computation
7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings
Published on 8. August 2012
Book
Paperback/Softback
X, 275 pages
978-3-642-33292-0 (ISBN)
Description
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.
More details
Series
Edition
2012 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
14 s/w Abbildungen
X, 275 p. 14 illus.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 16 mm
Weight
441 gr
ISBN-13
978-3-642-33292-0 (9783642332920)
DOI
10.1007/978-3-642-33293-7
Schweitzer Classification
Other editions
Additional editions
Dimitrios M. Thilikos | Gerhard J. Woeginger
Parameterized and Exact Computation
7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings
E-Book
08/2012
Springer
€48.14
Available for download
Content
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.