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

Fixed-parameter algorithms for cardinality-constrained graph partitioning problems on sparse graphs.

Autoři: Yamada, Suguru Hanaka, Tesshu

Zdroj: Discrete Applied Mathematics. Oct2025, Vol. 373, p343-354. 12p.

Témata: *REAL numbers, *GRAPH algorithms, *UNDIRECTED graphs, *SPARSE graphs, *INTEGERS, *WEIGHTED graphs

Fixed-Parameter Algorithms for Computing Bend-Restricted RAC Drawings of Graphs

Autoři: Cornelius Brand Robert Ganian Sebastian Röder a další

Zdroj: Journal of Graph Algorithms and Applications. 28:131-150

Témata: 0102 computer and information sciences, 01 natural sciences

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 Algorithms for the Kneser and Schrijver Problems

Autoři: Ishay Haviv

Zdroj: SIAM Journal on Computing. 53:287-314

Témata: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, Combinatorics (math.CO), 0101 mathematics, 01 natural sciences

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

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

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

A Fixed-Parameter Branching Algorithm for Chromatic Correlation Clustering

Autoři: Kensuke Oowa Peter Fulla Takuro Fukunaga

Zdroj: Lecture Notes in Computer Science ISBN: 9783031929342

Fixed-Parameter Algorithms for Unsplittable Flow Cover

Autoři: Andrés Cristi Mathieu Mari Andreas Wiese a další

Přispěvatelé: Andrés Cristi Mathieu Mari Andreas Wiese a další

Zdroj: Theory of Computing Systems. 67:89-124

Témata: Unsplittable Flow Cover, fixed parameter algorithms, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, ddc:004, [INFO] Computer Science [cs], approximation algorithms, 01 natural sciences, approximation al- gorithms

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/opus/volltexte/2020/11903/pdf/LIPIcs-STACS-2020-42.pdf
https://hal.science/hal-03587595v1
https://doi.org/10.4230/lipics.stacs.2020.42
https://hal.science/hal-03587595v1/document
https://link.springer.com/article/10.1007/s00224-021-10048-7
https://www.narcis.nl/publication/RecordID/oai%3Aresearch.vu.nl%3Apublications%2F07d0abbe-3029-4af0-b7a5-5e4c427cbe08
https://research.vu.nl/en/publications/fixed-parameter-algorithms-for-unsplittable-flow-cover
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.42

A fixed-parameter algorithm for a unit-execution-time unit-communication-time tasks scheduling problem with a limited number of identical processors

Autoři: Munier-Kordon, Alix Tang, Ning Sciences, EDP

Přispěvatelé: Munier-Kordon, Alix Tang, Ning Sciences, EDP

Zdroj: RAIRO - Operations Research. 56:3777-3788

Témata: communication delays, Scheduling, 0211 other engineering and technologies, minimization of the maximum lateness, [MATH] Mathematics [math], 02 engineering and technology, fixed-parameter algorithm

Popis souboru: application/pdf

Přístupová URL adresa: https://hal.science/hal-03836225v1
https://hal.science/hal-03836225v1/document
https://doi.org/10.1051/ro/2022174

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 Multi-Objective Evolutionary Algorithms for the W-Separator Problem.

Autoři: Baguley, Samuel Friedrich, Tobias Neumann, Aneta a další

Zdroj: Algorithmica. Apr2025, Vol. 87 Issue 4, p537-571. 35p.

Témata: *LINEAR programming, *ALGORITHMS, *MATHEMATICS, *GENERALIZATION, *EVOLUTIONARY algorithms

A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees

Autoři: Leo van Iersel Remie Janssen Mark Jones a další

Zdroj: Algorithmica. 84:917-960

Témata: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), 0206 medical engineering, Populations and Evolution (q-bio.PE), 0102 computer and information sciences, 02 engineering and technology, Fixed-parameter algorithms, 01 natural sciences, Phylogenetic networks, FOS: Biological sciences, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Hybridization number, Quantitative Biology - Populations and Evolution, 92D15 05C90 05C85 56R10, Computer Science - Discrete Mathematics

Přístupová URL adresa: http://arxiv.org/pdf/1907.08474
http://arxiv.org/abs/1907.08474
http://resolver.tudelft.nl/uuid:70e72477-d616-4b6f-a275-f16df603453b

Improved kernelization and fixed-parameter algorithms for bicluster editing

Autoři: Manuel Lafond

Zdroj: Journal of Combinatorial Optimization. 47

Témata: graph algorithms, FOS: Computer and information sciences, kernelization, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), biclustering, Computer science, parameterized complexity

Popis souboru: application/xml

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

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

Improved Fixed-Parameter Algorithm for the Tree Containment Problem on Unrooted Phylogenetic Network

Autoři: Feng Shi Hangcheng Li Guozhen Rong a další

Zdroj: IEEE/ACM Transactions on Computational Biology and Bioinformatics. 19:3539-3552

Témata: Models, Genetic, 0206 medical engineering, 0102 computer and information sciences, 02 engineering and technology, Biological Evolution, 01 natural sciences, Phylogeny, Algorithms

Přístupová URL adresa: https://pubmed.ncbi.nlm.nih.gov/34506290
https://ieeexplore.ieee.org/abstract/document/9535228
https://pubmed.ncbi.nlm.nih.gov/34506290/

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

Fixed-parameter algorithms for Fair Hitting Set problems

Autoři: Tanmay Inamdar Lawqueen Kanesh Madhumita Kundu a další

Přispěvatelé: Tanmay Inamdar Lawqueen Kanesh Madhumita Kundu a další

Zdroj: Information and Computation. 302:105261

Témata: FOS: Computer and information sciences, Fairness, Parameterized Algorithms, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Hitting Set

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2307.08854
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.55

Additional Titles: A Fixed-Parameter Branching Algorithm for Chromatic Correlation Clustering

Autoři: OOWA,Kensuke

Témata: Departmental Bulletin Paper., VoR.

URL: https://chuo-u.repo.nii.ac.jp/records/2003094
https://chuo-u.repo.nii.ac.jp/record/2003094/files/nenpou23N8100008K.pdf

Improved Fixed-Parameter Bounds for Min-Sum-Radii and Diameters k-Clustering and Their Fair Variants

Autoři: Banerjee, Sandip Bartal, Yair Gottlieb, Lee-Ad a další

Zdroj: Proceedings of the AAAI Conference on Artificial Intelligence. 39:15481-15488

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/2501.17708

Fixed-Parameter Tractability of the (1 + 1) Evolutionary Algorithm on Random Planted Vertex Covers

Autoři: Jack Kearney Frank Neumann Andrew M. Sutton

Zdroj: Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms. :96-104

Témata: FOS: Computer and information sciences, Computer Science - Neural and Evolutionary Computing, Neural and Evolutionary Computing (cs.NE)

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