New Frontiers in Parameterized Complexity and Algorithms
The research on parameterized complexity (PC), described in these peer-reviewed chapters by esteemed researchers, provides ties to practice as well as new theoretical developments, many in the direction of AI. Applications in bioinformatics and social choice are described, as well as faster, less co...
Uloženo v:
| Médium: | E-kniha |
|---|---|
| Jazyk: | angličtina |
| Vydáno: |
MDPI - Multidisciplinary Digital Publishing Institute
2024
|
| Témata: | |
| ISBN: | 9783725813025, 3725813019, 9783725813018, 3725813027 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | The research on parameterized complexity (PC), described in these peer-reviewed chapters by esteemed researchers, provides ties to practice as well as new theoretical developments, many in the direction of AI. Applications in bioinformatics and social choice are described, as well as faster, less costly approximation methods and new techniques using machine learning to find treewidth and other metrics. Many practical problems can be solved by harnessing the power of both PC and SAT solvers or integer linear programming modeled by parameterized graph problems. The extremely rapid development and deployment of PC continues to bring fresh understanding and solutions to fundamental open questions. |
|---|---|
| AbstractList | The research on parameterized complexity (PC), described in these peer-reviewed chapters by esteemed researchers, provides ties to practice as well as new theoretical developments, many in the direction of AI. Applications in bioinformatics and social choice are described, as well as faster, less costly approximation methods and new techniques using machine learning to find treewidth and other metrics. Many practical problems can be solved by harnessing the power of both PC and SAT solvers or integer linear programming modeled by parameterized graph problems. The extremely rapid development and deployment of PC continues to bring fresh understanding and solutions to fundamental open questions. |
| BookMark | eNotz81KAzEUBeCACmqdNxDJC0ST3KTJLEuxVijqQtflzuRGgzOTMhnw5-ltVc7iwLc4cM7Z8ZAHYuxKyWuAWt40Ob-X2nkBwmnrhQKphT1i1d7gIAewp6wqJTXSWm-cq-0Z8w_0wVdjHqZEY-Fp4E84Yk8TjembAl_mftfRZ5q-OA6BL7rXPKbprS8X7CRiV6j67xl7Wd0-L9di83h3v1xsBDpjrLCS5jKg0yF6MA4JGtMGCV45mO8TgiUNGIKODSiIrZeOWhWRlETUEWbs8m83446Gbcj4e3WroDZSwQ8CfEoq |
| ContentType | eBook |
| DBID | V1H |
| DOI | 10.3390/books978-3-7258-1302-5 |
| DatabaseName | DOAB: Directory of Open Access Books |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: V1H name: DOAB: Directory of Open Access Books url: https://directory.doabooks.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| Editor | Misra, Neeldhara Rosamond, Frances Zehavi, Meirav |
| Editor_xml | – sequence: 1 fullname: Rosamond, Frances – sequence: 2 fullname: Misra, Neeldhara – sequence: 3 fullname: Zehavi, Meirav |
| ExternalDocumentID | 139401 |
| GroupedDBID | ALMA_UNASSIGNED_HOLDINGS V1H |
| ID | FETCH-LOGICAL-a7445-50e60da72df8347ae3b4cd0381736363dd5e23add2fb313fc807ec1fae10aa2f3 |
| IEDL.DBID | V1H |
| ISBN | 9783725813025 3725813019 9783725813018 3725813027 |
| IngestDate | Tue Oct 07 20:17:12 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a7445-50e60da72df8347ae3b4cd0381736363dd5e23add2fb313fc807ec1fae10aa2f3 |
| OpenAccessLink | https://directory.doabooks.org/handle/20.500.12854/139401 |
| PageCount | 272 |
| ParticipantIDs | oapen_doabooks_139401 |
| PublicationCentury | 2000 |
| PublicationDate | 2024 |
| PublicationDateYYYYMMDD | 2024-01-01 |
| PublicationDate_xml | – year: 2024 text: 2024 |
| PublicationDecade | 2020 |
| PublicationYear | 2024 |
| Publisher | MDPI - Multidisciplinary Digital Publishing Institute |
| Publisher_xml | – name: MDPI - Multidisciplinary Digital Publishing Institute |
| SSID | ssib055847795 |
| Score | 2.384666 |
| Snippet | The research on parameterized complexity (PC), described in these peer-reviewed chapters by esteemed researchers, provides ties to practice as well as new... |
| SourceID | oapen |
| SourceType | Publisher |
| SubjectTerms | agreement forests algorithm selection approximation algorithms bounded search tree cascade failure combinatorial optimisation comparative genomics Computer science Computing and Information Technology dominating set enumeration ETH/SETH expected coverage feedback vertex set fine-grained fixed-parameter tractability FPT fpt-reductions genome assembly Hamming distance haplotyping hardness of approximation Heuristics hitting sets inapproximability influence maximization integer linear programming kernelization kidney exchange problem linear reliable ordering lower bounds machine learning model checking multilinear monomial detection ordering parameterised complexity parameterised enumeration parameterized AC0 parameterized algorithm parameterized complexity phylogenetics polynomial hierarchy probabilistic core probabilistic graphs random partitioning randomized algorithm sequence analysis solution diversity tree decomposition treedepth treewidth turbo-charged uncertain graphs vertex cover |
| Title | New Frontiers in Parameterized Complexity and Algorithms |
| URI | https://directory.doabooks.org/handle/20.500.12854/139401 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV07T8MwELYQZWAqjyLe8sBqGr9iZ0SIqlPVAVC3yrHPUAlS1AYk-PX4khaVgQl5si-W40ty9sV330fIlS9NjGklZTEXnimhkh3kXrMi2EJrl_mofUM2YUYjO5kU4w2qr9aQzzGqee5wn7lsjvNbyIHkqV_rDBERrFZ9jqTeyfHpJBcnx2iuRz5cv0oaT_9MoTGbwwhtk6XmxUZFmBZ850dof9eFbrOJpSyyfnMbbRgBihnKmUaGJPcG1cZyNOj-YyJ7pAOY37BPtqA6IN01qwNdfeSHBMl56ABxDZAlm84qOnYYwYWgzl8QKPZAFM36k6ZR6M3L03wxq59flz3yMLi7vx2yFb8Cc0YpzXQGeRacESFaqYwDWSofGsw-macSggYhkwEUsZRcRm8zA55HBzxzTkR5RLareQXHhPqSgzJl8rSdVHmwJQiXdBdzgHQdjyek1yhrulbGtJ306R_tZ2RXpN1D-6_jnGzXi3e4IDv-o54tF5fNo_4GplajKQ |
| linkProvider | Open Access Publishing in European Networks |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.title=New+Frontiers+in+Parameterized+Complexity+and+Algorithms&rft.date=2024-01-01&rft.pub=MDPI+-+Multidisciplinary+Digital+Publishing+Institute&rft.isbn=9783725813025&rft_id=info:doi/10.3390%2Fbooks978-3-7258-1302-5&rft.externalDBID=V1H&rft.externalDocID=139401 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9783725813025/lc.gif&client=summon&freeimage=true |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9783725813025/mc.gif&client=summon&freeimage=true |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9783725813025/sc.gif&client=summon&freeimage=true |