The Resource Fundamentals of parameterized complexity, Rodney G. Downey, Michael R. Fellows
Fundamentals of parameterized complexity, Rodney G. Downey, Michael R. Fellows
Resource Information
The item Fundamentals of parameterized complexity, Rodney G. Downey, Michael R. Fellows represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 2 library branches.
Resource Information
The item Fundamentals of parameterized complexity, Rodney G. Downey, Michael R. Fellows represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 2 library branches.
 Summary
 The field of parameterized complexity/multivariate complexity algorithmics is an exciting and vibrant part of theoretical computer science, responding to the vital need for efficient algorithms in modern society. This comprehensive and selfcontained textbook presents an accessible overview of the state of the art of multivariate algorithmics and complexity. Increasingly, multivariate algorithmics is having significant practical impact in many application domains, with even more developments on the horizon. The text describes how the multivariate framework allows an extended dialog with a problem, enabling the reader who masters the complexity issues under discussion to use the positive and negative toolkits in their own research. Topics and features: Describes many of the standard algorithmic techniques available for establishing parametric tractability. Reviews the classical hardness classes. Explores the various limitations and relaxations of the methods. Showcases the powerful new lower bound techniques Examines various different algorithmic solutions to the same problems, highlighting the insights to be gained from each approach Demonstrates how complexity methods and ideas have evolved over the past 25 years This classroomtested and easytofollow textbook/reference is essential reading for the beginning graduate student and advanced undergraduate student. The book will also serve as an invaluable resource for the general computer scientist and the mathematicallyaware scientist seeking tools for their research
 Language
 eng
 Extent
 1 online resource (848 pages)
 Contents

 Further Elementary Techniques
 Color Coding, Multilinear Detection, and Randomized Divide and Conquer
 Optimization Problems, Approximation Schemes, and Their Relation to FPT
 Techniques Based on Graph Structure.
 Treewidth and Dynamic Programming
 Heuristics for Treewidth
 Methods via Automata and Bounded Treewidth
 Courcelle's Theorem
 More on WidthMetrics: Applications and Local Treewidth
 DepthFirst Search and the PlehnVoigt Theorem
 Parameterized Tractability.
 Other Width Metrics
 Exotic Metatechniques.
 WellQuasiOrderings and the RobertsonSeymour Theorems
 The Graph Minor Theorem
 Applications of the Obstruction Principle and WQOs
 Hardness Theory.
 Reductions
 The Basic Class W[1] and an Analog of Cook's Theorem
 Some Other W[1] Hardness Results
 The WHierarchy
 Preliminaries
 The Monotone and Antimonotone Collapse Theorems: Monotone W[2t+1]=W[2t] and Antimonotone W[2t+2]=W[2t+1]
 Beyond W[t]Hardness
 Fixed Parameter Analogues of PSpace and kMove Games
 Provable Intractability: The Class XP
 Another Basis for the WHierarchy and the Tradeoff Theorem
 Approximations, Connections, Lower Bounds.
 The MHierarchy, and XPOptimality
 Kernelization Lower Bounds
 Further Topics.
 Parameterized Approximation
 The Basic Definitions
 Parameterized Counting and Randomization
 Research Horizons.
 Research Horizons
 Appendices.
 Appendix 1:
 Network Flows and Matchings
 
 Appendix 2:
 Menger's Theorems
 Elementary Positive Techniques.
 Bounded Search Trees
 Kernelization
 More on Kernelization
 Iterative Compression, and Measure and Conquer, for Minimization Problems
 Isbn
 9781447155591
 Label
 Fundamentals of parameterized complexity
 Title
 Fundamentals of parameterized complexity
 Statement of responsibility
 Rodney G. Downey, Michael R. Fellows
 Language
 eng
 Summary
 The field of parameterized complexity/multivariate complexity algorithmics is an exciting and vibrant part of theoretical computer science, responding to the vital need for efficient algorithms in modern society. This comprehensive and selfcontained textbook presents an accessible overview of the state of the art of multivariate algorithmics and complexity. Increasingly, multivariate algorithmics is having significant practical impact in many application domains, with even more developments on the horizon. The text describes how the multivariate framework allows an extended dialog with a problem, enabling the reader who masters the complexity issues under discussion to use the positive and negative toolkits in their own research. Topics and features: Describes many of the standard algorithmic techniques available for establishing parametric tractability. Reviews the classical hardness classes. Explores the various limitations and relaxations of the methods. Showcases the powerful new lower bound techniques Examines various different algorithmic solutions to the same problems, highlighting the insights to be gained from each approach Demonstrates how complexity methods and ideas have evolved over the past 25 years This classroomtested and easytofollow textbook/reference is essential reading for the beginning graduate student and advanced undergraduate student. The book will also serve as an invaluable resource for the general computer scientist and the mathematicallyaware scientist seeking tools for their research
 Cataloging source
 GW5XE
 http://library.link/vocab/creatorName
 Downey, R. G.
 Dewey number
 005.1
 Illustrations
 illustrations
 Index
 no index present
 LC call number
 QA76.9.A43
 Literary form
 non fiction
 Nature of contents
 dictionaries
 http://library.link/vocab/relatedWorkOrContributorDate
 1952
 http://library.link/vocab/relatedWorkOrContributorName
 Fellows, M. R.
 Series statement
 Texts in Computer Science
 http://library.link/vocab/subjectName

 Computer algorithms
 Computer science
 Computer algorithms
 Computer science
 Label
 Fundamentals of parameterized complexity, Rodney G. Downey, Michael R. Fellows
 Antecedent source
 unknown
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Color
 multicolored
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents

 Further Elementary Techniques
 Color Coding, Multilinear Detection, and Randomized Divide and Conquer
 Optimization Problems, Approximation Schemes, and Their Relation to FPT
 Techniques Based on Graph Structure.
 Treewidth and Dynamic Programming
 Heuristics for Treewidth
 Methods via Automata and Bounded Treewidth
 Courcelle's Theorem
 More on WidthMetrics: Applications and Local Treewidth
 DepthFirst Search and the PlehnVoigt Theorem
 Parameterized Tractability.
 Other Width Metrics
 Exotic Metatechniques.
 WellQuasiOrderings and the RobertsonSeymour Theorems
 The Graph Minor Theorem
 Applications of the Obstruction Principle and WQOs
 Hardness Theory.
 Reductions
 The Basic Class W[1] and an Analog of Cook's Theorem
 Some Other W[1] Hardness Results
 The WHierarchy
 Preliminaries
 The Monotone and Antimonotone Collapse Theorems: Monotone W[2t+1]=W[2t] and Antimonotone W[2t+2]=W[2t+1]
 Beyond W[t]Hardness
 Fixed Parameter Analogues of PSpace and kMove Games
 Provable Intractability: The Class XP
 Another Basis for the WHierarchy and the Tradeoff Theorem
 Approximations, Connections, Lower Bounds.
 The MHierarchy, and XPOptimality
 Kernelization Lower Bounds
 Further Topics.
 Parameterized Approximation
 The Basic Definitions
 Parameterized Counting and Randomization
 Research Horizons.
 Research Horizons
 Appendices.
 Appendix 1:
 Network Flows and Matchings
 
 Appendix 2:
 Menger's Theorems
 Elementary Positive Techniques.
 Bounded Search Trees
 Kernelization
 More on Kernelization
 Iterative Compression, and Measure and Conquer, for Minimization Problems
 Control code
 865474474
 Dimensions
 unknown
 Extent
 1 online resource (848 pages)
 File format
 unknown
 Form of item
 online
 Isbn
 9781447155591
 Level of compression
 unknown
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/9781447155591
 Other physical details
 illustrations.
 Quality assurance targets
 not applicable
 Reformatting quality
 unknown
 Sound
 unknown sound
 Specific material designation
 remote
 System control number
 (OCoLC)865474474
 Label
 Fundamentals of parameterized complexity, Rodney G. Downey, Michael R. Fellows
 Antecedent source
 unknown
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Color
 multicolored
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents

 Further Elementary Techniques
 Color Coding, Multilinear Detection, and Randomized Divide and Conquer
 Optimization Problems, Approximation Schemes, and Their Relation to FPT
 Techniques Based on Graph Structure.
 Treewidth and Dynamic Programming
 Heuristics for Treewidth
 Methods via Automata and Bounded Treewidth
 Courcelle's Theorem
 More on WidthMetrics: Applications and Local Treewidth
 DepthFirst Search and the PlehnVoigt Theorem
 Parameterized Tractability.
 Other Width Metrics
 Exotic Metatechniques.
 WellQuasiOrderings and the RobertsonSeymour Theorems
 The Graph Minor Theorem
 Applications of the Obstruction Principle and WQOs
 Hardness Theory.
 Reductions
 The Basic Class W[1] and an Analog of Cook's Theorem
 Some Other W[1] Hardness Results
 The WHierarchy
 Preliminaries
 The Monotone and Antimonotone Collapse Theorems: Monotone W[2t+1]=W[2t] and Antimonotone W[2t+2]=W[2t+1]
 Beyond W[t]Hardness
 Fixed Parameter Analogues of PSpace and kMove Games
 Provable Intractability: The Class XP
 Another Basis for the WHierarchy and the Tradeoff Theorem
 Approximations, Connections, Lower Bounds.
 The MHierarchy, and XPOptimality
 Kernelization Lower Bounds
 Further Topics.
 Parameterized Approximation
 The Basic Definitions
 Parameterized Counting and Randomization
 Research Horizons.
 Research Horizons
 Appendices.
 Appendix 1:
 Network Flows and Matchings
 
 Appendix 2:
 Menger's Theorems
 Elementary Positive Techniques.
 Bounded Search Trees
 Kernelization
 More on Kernelization
 Iterative Compression, and Measure and Conquer, for Minimization Problems
 Control code
 865474474
 Dimensions
 unknown
 Extent
 1 online resource (848 pages)
 File format
 unknown
 Form of item
 online
 Isbn
 9781447155591
 Level of compression
 unknown
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/9781447155591
 Other physical details
 illustrations.
 Quality assurance targets
 not applicable
 Reformatting quality
 unknown
 Sound
 unknown sound
 Specific material designation
 remote
 System control number
 (OCoLC)865474474
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/FundamentalsofparameterizedcomplexityRodney/7ML7kHGplek/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/FundamentalsofparameterizedcomplexityRodney/7ML7kHGplek/">Fundamentals of parameterized complexity, Rodney G. Downey, Michael R. Fellows</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Fundamentals of parameterized complexity, Rodney G. Downey, Michael R. Fellows
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/FundamentalsofparameterizedcomplexityRodney/7ML7kHGplek/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/FundamentalsofparameterizedcomplexityRodney/7ML7kHGplek/">Fundamentals of parameterized complexity, Rodney G. Downey, Michael R. Fellows</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>