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: | Online |
|---|---|
| Jazyk: | angličtina |
| Vydáno: |
MDPI - Multidisciplinary Digital Publishing Institute
2024
|
| Témata: | |
| On-line přístup: | ONIX_20240704_9783725813018_197 |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| _version_ | 1869529204243038208 |
|---|---|
| collection | Directory of Open Access Books |
| description | 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. |
| format | Online |
| id | doab-20.500.12854ir-139401 |
| institution | Directory of Open Access Books |
| language | eng |
| publishDate | 2024 |
| publishDateRange | 2024 |
| publishDateSort | 2024 |
| publisher | MDPI - Multidisciplinary Digital Publishing Institute |
| publisherStr | MDPI - Multidisciplinary Digital Publishing Institute |
| record_format | ojs |
| spelling | doab-20.500.12854ir-1394012024-07-04T09:50:36Z New Frontiers in Parameterized Complexity and Algorithms Rosamond, Frances Misra, Neeldhara Zehavi, Meirav kidney exchange problem randomized algorithm parameterized algorithm random partitioning multilinear monomial detection fixed-parameter tractability treewidth model checking parameterized complexity polynomial hierarchy fpt-reductions parameterised complexity enumeration bounded search tree parameterised enumeration ordering tree decomposition algorithm selection machine learning combinatorial optimisation parameterized AC0 dominating set inapproximability integer linear programming treedepth solution diversity hitting sets vertex cover feedback vertex set Hamming distance genome assembly sequence analysis comparative genomics haplotyping phylogenetics agreement forests probabilistic graphs uncertain graphs influence maximization cascade failure linear reliable ordering expected coverage probabilistic core. approximation algorithms hardness of approximation FPT kernelization lower bounds fine-grained Heuristics turbo-charged ETH/SETH thema EDItEUR::U Computing and Information Technology thema EDItEUR::U Computing and Information Technology::UY Computer science 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. 2024-07-04T09:50:32Z 2024-07-04T09:50:32Z 2024 book ONIX_20240704_9783725813018_197 9783725813018 9783725813025 https://directory.doabooks.org/handle/20.500.12854/139401 eng application/octet-stream Attribution-NonCommercial-NoDerivatives 4.0 International https://mdpi.com/books/pdfview/book/9401 https://mdpi.com/books/pdfview/book/9401 MDPI - Multidisciplinary Digital Publishing Institute 10.3390/books978-3-7258-1302-5 10.3390/books978-3-7258-1302-5 46cabcaa-dd94-4bfe-87b4-55023c1b36d0 9783725813018 9783725813025 272 open access |
| spellingShingle | kidney exchange problem randomized algorithm parameterized algorithm random partitioning multilinear monomial detection fixed-parameter tractability treewidth model checking parameterized complexity polynomial hierarchy fpt-reductions parameterised complexity enumeration bounded search tree parameterised enumeration ordering tree decomposition algorithm selection machine learning combinatorial optimisation parameterized AC0 dominating set inapproximability integer linear programming treedepth solution diversity hitting sets vertex cover feedback vertex set Hamming distance genome assembly sequence analysis comparative genomics haplotyping phylogenetics agreement forests probabilistic graphs uncertain graphs influence maximization cascade failure linear reliable ordering expected coverage probabilistic core. approximation algorithms hardness of approximation FPT kernelization lower bounds fine-grained Heuristics turbo-charged ETH/SETH thema EDItEUR::U Computing and Information Technology thema EDItEUR::U Computing and Information Technology::UY Computer science New Frontiers in Parameterized Complexity and Algorithms |
| title | New Frontiers in Parameterized Complexity and Algorithms |
| title_full | New Frontiers in Parameterized Complexity and Algorithms |
| title_fullStr | New Frontiers in Parameterized Complexity and Algorithms |
| title_full_unstemmed | New Frontiers in Parameterized Complexity and Algorithms |
| title_short | New Frontiers in Parameterized Complexity and Algorithms |
| title_sort | new frontiers in parameterized complexity and algorithms |
| topic | kidney exchange problem randomized algorithm parameterized algorithm random partitioning multilinear monomial detection fixed-parameter tractability treewidth model checking parameterized complexity polynomial hierarchy fpt-reductions parameterised complexity enumeration bounded search tree parameterised enumeration ordering tree decomposition algorithm selection machine learning combinatorial optimisation parameterized AC0 dominating set inapproximability integer linear programming treedepth solution diversity hitting sets vertex cover feedback vertex set Hamming distance genome assembly sequence analysis comparative genomics haplotyping phylogenetics agreement forests probabilistic graphs uncertain graphs influence maximization cascade failure linear reliable ordering expected coverage probabilistic core. approximation algorithms hardness of approximation FPT kernelization lower bounds fine-grained Heuristics turbo-charged ETH/SETH thema EDItEUR::U Computing and Information Technology thema EDItEUR::U Computing and Information Technology::UY Computer science |
| topic_facet | kidney exchange problem randomized algorithm parameterized algorithm random partitioning multilinear monomial detection fixed-parameter tractability treewidth model checking parameterized complexity polynomial hierarchy fpt-reductions parameterised complexity enumeration bounded search tree parameterised enumeration ordering tree decomposition algorithm selection machine learning combinatorial optimisation parameterized AC0 dominating set inapproximability integer linear programming treedepth solution diversity hitting sets vertex cover feedback vertex set Hamming distance genome assembly sequence analysis comparative genomics haplotyping phylogenetics agreement forests probabilistic graphs uncertain graphs influence maximization cascade failure linear reliable ordering expected coverage probabilistic core. approximation algorithms hardness of approximation FPT kernelization lower bounds fine-grained Heuristics turbo-charged ETH/SETH thema EDItEUR::U Computing and Information Technology thema EDItEUR::U Computing and Information Technology::UY Computer science |
| url | ONIX_20240704_9783725813018_197 |