Výsledky vyhledávání - "parameterized algorithms"

Parameterized Algorithms for Steiner Forest in Bounded Width Graphs

Autoři: Andreas Emil Feldmann Michael Lampis Andreas Emil Feldmann and Michael Lampis

Přispěvatelé: Andreas Emil Feldmann Michael Lampis Andreas Emil Feldmann and Michael Lampis

Zdroj: ACM Transactions on Algorithms. 21:1-26

Témata: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Approximation Algorithms, FPT algorithms, Steiner Forest

Popis souboru: application/pdf

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

Parameterized Algorithms for Non-uniform All-to-all

Autoři: Ke Fan Jens Domke Seydou Ba a další

Zdroj: Proceedings of the 34th International Symposium on High-Performance Parallel and Distributed Computing. :1-13

Subexponential Parameterized Algorithms for Hitting Subgraphs

Autoři: Daniel Lokshtanov Fahad Panolan Saket Saurabh a další

Zdroj: Proceedings of the 57th Annual ACM Symposium on Theory of Computing. :1975-1984

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

Parameterized Algorithms for Computing Pareto Sets

Autoři: Könen, Joshua Marc Röglin, Heiko Stuck, Tarek a další

Přispěvatelé: Könen, Joshua Marc Röglin, Heiko Stuck, Tarek a další

Témata: polygon aggregation, FOS: Computer and information sciences, parameterized algorithms, Data Structures and Algorithms, treewidth, multicriteria optimization problems, multicriteria TSP, Data Structures and Algorithms (cs.DS), multicriteria MST, ddc:004

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2509.06124
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.105

Efficient parameterized algorithms for computing all-pairs shortest paths

Autoři: Stefan Kratsch Florian Nelles Stefan Kratsch and Florian Nelles

Přispěvatelé: Stefan Kratsch Florian Nelles Stefan Kratsch and Florian Nelles

Zdroj: Discrete Applied Mathematics. 341:102-119

Témata: FOS: Computer and information sciences, Clique-width, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, parameterized Complexity, 01 natural sciences, Modular-width, All-pairs shortest Paths, efficient parameterized Algorithms, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2001.04908
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.38

Parameterized Algorithms for Editing to Uniform Cluster Graph

Autoři: Gaikwad, Ajinkya Kumar, Hitendra Maity, Soumen

Zdroj: Lecture Notes in Computer Science ISBN: 9783032046994

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

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

Improved Parameterized Algorithms for Scheduling with Precedence Constraints and Time Windows

Autoři: Feng Shi Yicong Zhu Guangwei Wu a další

Zdroj: Lecture Notes in Computer Science ISBN: 9789819502172

Parameterized Algorithms for the Tree Containment Problem on Multifurcating Phylogenetic Network

Autoři: Feng Shi Zhanglian Lin Xin Zeng a další

Zdroj: Lecture Notes in Computer Science ISBN: 9789819506941

Parameterized Algorithms

Autoři: Marek Cygan Fedor V. Fomin Łukasz Kowalik a další

Resource Type: eBook.

Témata: Algorithms

Categories: COMPUTERS / Programming / Algorithms

Faster parameterized algorithms for modification problems to minor-closed classes

Autoři: Morelle, Laure Sau, Ignasi Stamoulis, Giannos a další

Přispěvatelé: Morelle, Laure Sau, Ignasi Stamoulis, Giannos a další

Zdroj: TheoretiCS. 3

Témata: FOS: Computer and information sciences, Elimination distance, Obstructions, 05C85, 68R10, 05C75, 05C83, 05C75, 05C69, G.2.2, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, Vertex deletion, Irrelevant vertex technique, Parameterized algorithms, Computer Science - Data Structures and Algorithms, FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Mathematics - Combinatorics, Flat Wall Theorem, Data Structures and Algorithms (cs.DS), F.2.2, Graph minors, Computer Science - Computational Complexity, Combinatorics (math.CO), ddc:004, Graph modification problems

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2210.02167
https://theoretics.episciences.org/11623
https://doi.org/10.46298/theoretics.24.19
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.93

Combinatorial Parameterized Algorithms for Chemical Descriptors based on Molecular Graph Sparsity.

Autoři: Conrado, Giovanna Kobus Goharshady, Amir Kafshdar Motwani, Harshit Jitendra a další

Zdroj: Procedia Computer Science. 2025, Vol. 273, p247-254. 8p.

Témata: Molecular graphs, Computational chemistry, Empirical research, Parameterization, Chemical properties, Graph theory, Combinatorial optimization, Sparse graphs

Parameterized algorithms for multi-label periodic temporal graph realization

Autoři: Thomas Erlebach Nils Morawietz Petra Wolf a další

Přispěvatelé: Thomas Erlebach Nils Morawietz Petra Wolf a další

Zdroj: Theoretical Computer Science. 1051:115412

Témata: Fixed-Parameter Tractability, Temporal Graph, Almost-Clique, Kernelization, ddc:004, Dynamic Network

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024.12

Faster parameterized algorithms for variants of 3-Hitting Set

Autoři: Dekel Tsur

Zdroj: Journal of Combinatorial Optimization. 49

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth

Autoři: Benjamin Bergougnoux Vera Chekan Robert Ganian a další

Přispěvatelé: Benjamin Bergougnoux Vera Chekan Robert Ganian a další

Zdroj: ACM Transactions on Computation Theory.

Témata: FOS: Computer and information sciences, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Parameterized complexity, algebraic methods, shrubdepth, Data Structures and Algorithms, Theory of computation → Parameterized complexity and exact algorithms, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Data Structures and Algorithms (cs.DS), ddc:004, space complexity

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2307.01285
http://10.10.70.176:8080/experts/en/publications/8b2e5cfb-2dbc-4b4f-9a00-19a72f8ebc29
https://doi.org/10.48550/arXiv.2307.01285
https://research-portal.uu.nl/en/publications/80bbb077-5744-4a6a-b94d-46d26a0c57d1
https://doi.org/10.4230/LIPIcs.ESA.2023.18
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.18
https://hal.science/hal-04492602v1
https://hal.science/hal-04492602v1/document
https://doi.org/10.1145/3723880
https://hal.science/hal-04492601v1
https://doi.org/10.4230/lipics.esa.2023.18
https://dspace.library.uu.nl/handle/1874/431814

Parameterized Algorithms for Power Edge Set and Zero Forcing Set

Autoři: Sriram Bhyravarapu Lawqueen Kanesh Madhumita Kundu a další

Zdroj: Lecture Notes in Computer Science ISBN: 9783031987397

Approximation and Parameterized Algorithms for Covering with Disks of Two Types of Radii

Autoři: Bandyapadhyay, Sayan Mitchell, Eli Sayan Bandyapadhyay and Eli Mitchell

Přispěvatelé: Bandyapadhyay, Sayan Mitchell, Eli Sayan Bandyapadhyay and Eli Mitchell

Témata: Covering, Disks, FPT, ddc:004, Approximation

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WADS.2025.7

Minimum Sum Vertex Cover: Kernelization and Parameterized Algorithms

Autoři: Cao, Yixin Gai, Ling Liu, Jingyi a další

Zdroj: Lecture Notes in Computer Science ISBN: 9789819610891

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

Exact and Parameterized Algorithms for Window Width Minimization in Bipartite Arrangement

Autoři: Shashank Chauhan Tanmay Inamdar Lawqueen Kanesh a další

Zdroj: Lecture Notes in Computer Science ISBN: 9783031929342

Parameterized Algorithms for Matching Integer Programs with Additional Rows and Columns

Autoři: Lassota, Alexandra Ligthart, Koen Alexandra Lassota and Koen Ligthart

Přispěvatelé: Lassota, Alexandra Ligthart, Koen Alexandra Lassota and Koen Ligthart

Témata: FOS: Computer and information sciences, Computer Science - Computational Complexity, Matchings, fixed-parameter Tractability, polyhedral Optimization, ddc:004, Computational Complexity (cs.CC), Integer Programming

Popis souboru: application/pdf

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

Parameterized Algorithms for Planar 2-Layer Drawing by Vertex Splitting on a Given Subset

Autoři: Yunlong Liu Guang Xiao Jingui Huang a další

Zdroj: Lecture Notes in Computer Science ISBN: 9789819610891