Parameterized and Exact Computation [electronic resource] : 7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings / edited by Dimitrios M. Thilikos, Gerhard J. Woeginger.
Contributor(s): Thilikos, Dimitrios M [editor.]
| Woeginger, Gerhard J [editor.] | SpringerLink (Online service).
Material type: 
BookSeries: Theoretical Computer Science and General Issues: 7535Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2012Edition: 1st ed. 2012.Description: X, 275 p. 14 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642332937.Subject(s): Algorithms | Numerical analysis | Computer science -- Mathematics | Discrete mathematics | Artificial intelligence -- Data processing | Algorithms | Numerical Analysis | Discrete Mathematics in Computer Science | Data Science | Mathematical Applications in Computer ScienceAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 518.1 Online resources: Click here to access online
In:
Springer Nature eBookSummary: 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.
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.
There are no comments for this item.