Výsledky vyhledávání - fixed-parameter tractable algorithms*

Fixed parameter tractable algorithms for watchman route related problems on line segment arrangements

Autoři: Remi Raman Shahin John J S R. Subashini a další

Zdroj: International Journal of Computer Mathematics: Computer Systems Theory. 9:131-138

Fixed-Parameter Tractable Certified Algorithms for Covering and Dominating in Planar Graphs and Beyond

Autoři: Bumpus, Benjamin Merlin Jansen, Bart M. P. Venne, Jaime a další

Přispěvatelé: Bumpus, Benjamin Merlin Jansen, Bart M. P. Venne, Jaime a další

Témata: certified algorithms, fixed-parameter tractability, ddc:004

Popis souboru: application/pdf

Přístupová URL adresa: https://research.tue.nl/en/publications/33376f2e-73b6-4806-a0fd-fdc39dbf36b9
https://doi.org/10.4230/LIPICS.SWAT.2024.19
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.19

Computing Distances on Graph Associahedra is Fixed-parameter Tractable

Autoři: Cunha, Luís Felipe I. Sau, Ignasi Souza, Uéverton S. a další

Přispěvatelé: Cunha, Luís Felipe I. Sau, Ignasi Souza, Uéverton S. a další

Témata: Computational Geometry (cs.CG), FOS: Computer and information sciences, reconfiguration, Discrete Mathematics (cs.DM), fixed-parameter tractable algorithm, elimination tree, G.2.1, G.2.2, G.2.3, rotation distance, graph associahedra, combinatorial shortest path, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Computer Science - Computational Geometry, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, 05C85, 05C10, 0C05, 90C08, 90C27, parameterized complexity, Computer Science - Discrete Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2504.18338
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.63

Pairwise rearrangement is fixed-parameter tractable in the Single Cut-and-Join model

Autoři: Lora Bailey Heather Smith Blake Garner Cochran a další

Přispěvatelé: Lora Bailey Heather Smith Blake Garner Cochran a další

Zdroj: Theoretical Computer Science. 1055:115481

Témata: Genomics (q-bio.GN), FOS: Computer and information sciences, Computational Complexity, Genome Rearrangement, Phylogenetics, 92-08, 92D10, 92D20, 68Q17, FOS: Biological sciences, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Quantitative Biology - Genomics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, F.2.2, Single Cut-and-Join

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2402.01942
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.3

Fixed-Parameter Tractable Submodular Maximization over a Matroid

Autoři: Nematollahi, Shamisa Vladu, Adrian Zhao, Junyao

Témata: FOS: Computer and information sciences, Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

Přístupová URL adresa: http://arxiv.org/abs/2509.01591

A Fixed-Parameter Tractable Algorithm for Finding Agreement Cherry-Reduced Subnetworks in Level-1 Orchard Networks

Autoři: Kaari Landry Olivier Tremblay-savard Manuel Lafond

Zdroj: Journal of Computational Biology. 31:360-379

Témata: Computational Biology, Algorithms, Phylogeny

Přístupová URL adresa: https://pubmed.ncbi.nlm.nih.gov/38117611

Fixed-parameter tractable algorithms for Tracking Shortest Paths

Autoři: Aritra Banik Pratibha Choudhary Venkatesh Raman a další

Zdroj: Theoretical Computer Science. 846:1-13

Témata: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Přístupová URL adresa: http://arxiv.org/pdf/2001.08977
http://arxiv.org/abs/2001.08977
https://jglobal.jst.go.jp/detail?JGLOBAL_ID=202002290799526426
https://ui.adsabs.harvard.edu/abs/2020arXiv200108977B/abstract
https://www.sciencedirect.com/science/article/abs/pii/S0304397520305053
http://dblp.uni-trier.de/db/journals/corr/corr2001.html#abs-2001-08977
https://doi.org/10.1016/j.tcs.2020.09.006
https://dblp.uni-trier.de/db/journals/corr/corr2001.html#abs-2001-08977

Planar Disjoint Shortest Paths is Fixed-Parameter Tractable

Autoři: Pilipczuk, Michał Stamoulis, Giannos Włodarczyk, Michał

Témata: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

Přístupová URL adresa: http://arxiv.org/abs/2505.03353

Fixed-Parameter Tractable Algorithms for Rejection-Proof Kidney Exchange

Autoři: Lamme, Jeroen S.K.

Témata: Master

URL: https://pure.tue.nl/ws/files/351955360/Lamme_J.pdf
https://pure.tue.nl/ws/files/351955360/Lamme_J.pdf

Fixed-Parameter Tractable Algorithms on Directed Graphs using H-Treewidth

Autoři: Gorissen, Bart J.M.

Témata: Master

URL: https://pure.tue.nl/ws/files/350971700/Gorissen_B.pdf
https://pure.tue.nl/ws/files/350971700/Gorissen_B.pdf

A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity

Autoři: Tayal, Mumuksh

Témata: FOS: Computer and information sciences, Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

Přístupová URL adresa: http://arxiv.org/abs/2507.09377

A Fixed-Parameter Tractable Algorithm for Counting Markov Equivalence Classes with the Same Skeleton

Autoři: Sharma, Vidya Sagar

Zdroj: Proceedings of the AAAI Conference on Artificial Intelligence. 38:20532-20539

Témata: FOS: Computer and information sciences, Computer Science - Machine Learning, Artificial Intelligence (cs.AI), Computer Science - Artificial Intelligence, Computer Science - Data Structures and Algorithms, 0211 other engineering and technologies, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Machine Learning (cs.LG)

Přístupová URL adresa: http://arxiv.org/abs/2310.04218

Near-Linear Time and Fixed-Parameter Tractable Algorithms for Tensor Decompositions

Autoři: Mahankali, Arvind V. Woodruff, David P. Zhang, Ziyu a další

Přispěvatelé: Mahankali, Arvind V. Woodruff, David P. Zhang, Ziyu a další

Témata: FOS: Computer and information sciences, Computer Science - Machine Learning, Tensor decomposition, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Low rank approximation, Sketching algorithms, Machine Learning (cs.LG)

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2207.07417
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.79

Faster Fixed Parameter Tractable Algorithms for Counting Markov Equivalence Classes with Special Skeletons

Autoři: Sharma, Vidya Sagar

Témata: Computer Science - Data Structures and Algorithms, text

URL: http://arxiv.org/abs/2312.17626

Fixed Parameter Tractable Algorithms for Watchman Route Related Problems on Rectilinear Line Segment Arrangements

Autoři: Remi Raman Shahin John J S Subashini R a další

Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs

Autoři: Pradeesha Ashok Saket Saurabh Sudeshna Kolay a další

Zdroj: SIAM Journal on Discrete Mathematics. 32:1189-1208

Témata: Maximization algorithms, Conflict-free coloring, 0102 computer and information sciences, FPT algorithms, 01 natural sciences, Unique-maximum coloring

Přístupová URL adresa: https://pure.tue.nl/ws/files/102167270/16m1107462.pdf
https://dblp.uni-trier.de/db/journals/siamdm/siamdm32.html#AshokDKS18
https://doi.org/10.1137/16M1107462
https://epubs.siam.org/doi/10.1137/16M1107462
https://locus.siam.org/doi/abs/10.1137/16M1107462

Fixed-parameter algorithms for the weighted Max-Cut problem on embedded 1-planar graphs

Autoři: Christine Dahn Nils M. Kriege Petra Mutzel a další

Zdroj: Theoretical Computer Science. 852:172-184

Témata: FOS: Computer and information sciences, COMPLEXITY, Fixed-parameter tractable, MAXIMUM CUT, 101011 Graphentheorie, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, 102031 Theoretische Informatik, Weighted maximum cut, 101011 Graph theory, 102031 Theoretical computer science, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), OPTIMIZATION, 1-planar graphs, APPROXIMATION

Přístupová URL adresa: http://arxiv.org/pdf/1812.03074
http://arxiv.org/abs/1812.03074
https://ui.adsabs.harvard.edu/abs/2018arXiv181203074D/abstract
https://doi.org/10.1016/j.tcs.2020.11.030
https://www.sciencedirect.com/science/article/pii/S0304397520306721
https://dblp.uni-trier.de/db/journals/corr/corr1812.html#abs-1812-03074

A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth

Autoři: Kanté, Mamadou Moustapha Paul, Christophe Thilikos, Dimitrios M. a další

Přispěvatelé: Kanté, Mamadou Moustapha Paul, Christophe Thilikos, Dimitrios M. a další

Zdroj: SIAM Journal on Discrete Mathematics. 36:411-435

Témata: FOS: Computer and information sciences, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Pathwidth, G.2.2, 0102 computer and information sciences, 01 natural sciences, Typical sequences, Graph theory, [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Parameterized algorithms, Computer Science - Data Structures and Algorithms, Cops and Robber games, Data Structures and Algorithms (cs.DS), 05C85, ddc:004, Width parameter, Graph decompositions, Graph searching

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/opus/volltexte/2020/12930/pdf/LIPIcs-ESA-2020-64.pdf
http://arxiv.org/abs/2004.11937
https://hal.archives-ouvertes.fr/hal-03002761/document
https://hal.archives-ouvertes.fr/hal-03002761
https://drops.dagstuhl.de/opus/volltexte/2020/12930/pdf/LIPIcs-ESA-2020-64.pdf/
https://doi.org/10.4230/LIPIcs.ESA.2020.64
http://ui.adsabs.harvard.edu/abs/2020arXiv200411937M/abstract
https://arxiv.org/abs/2004.11937
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.64
https://hal.science/hal-03002761v1
https://hal.science/hal-03002761v1/document
https://doi.org/10.4230/lipics.esa.2020.64

Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable

Autoři: Bandyapadhyay, Sayan Lochet, William Lokshtanov, Daniel a další

Zdroj: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977912

Témata: Computational Geometry (cs.CG), FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS)

Přístupová URL adresa: http://arxiv.org/abs/2312.01589

Fixed-Parameter Tractable Algorithms for Refined Parameterizations of Graph Problems

Autoři: van Roozendaal, Tom

Témata: Master, Master

URL: https://pure.tue.nl/ws/files/305626964/Roozendaal_T.pdf
https://pure.tue.nl/ws/files/305626964/Roozendaal_T.pdf