A Compendium of Parameterized Complexity Result s Michael T . Hallett and H. Todd Wareha m Department of Computer Scienc e University of Victori a Victoria, BC Canada V8W 3P 6 A large list of complexity results for parameterized problems has recently been compile d and is now available via anonymous ftp . The list provides a reasonably complete collection o f approximately one hundred problems which are known to be either fixed parameter tractabl e or hard for various levels of the W-Hierarchy . The W-Hierarchy is a structural tool fo r studying the apparent intractability of problems when one or more parameters to a proble m are held fixed . Typically, what is of issue in this framework is best exemplified by comparing th e tractability of VERTEX COVER with the apparent intractability of CLIQUE when the siz e of the vertex sets is a fixed constant . Whereas the former requires time linear in Ix1 but exponential in k, where Ix l is the size of the graph and k is the size of the relevant vertex set, the best known algorithm for the latter requires D(lx1 k ) time . In many ways, this
End of preview. The entire article is 2 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/a-compendium-of-parameterized-complexity-results-Y6OcXYwCTS
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
A compendium of parameterized complexity results
Hallett, Michael T.; Wareham, H. Todd
Follow ACM SIGACT News
, Volume 25 (3)
Association for Computing Machinery – Sep 1, 1994
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
