Suchergebnisse - "Kernelization algorithms"

Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems

Autoren: Tomohiro Koana Christian Komusiewicz Frank Sommer et al.

Weitere Verfasser: Tomohiro Koana Christian Komusiewicz Frank Sommer et al.

Quelle: SIAM Journal on Discrete Mathematics. 36:2798-2821

Schlagwörter: Ramsey numbers, Irredundant Set, Fixed-parameter tractability, kernelization, Induced Matching, 0102 computer and information sciences, ddc:004, Dominating Set, c-closure, 01 natural sciences

Dateibeschreibung: application/pdf

Zugangs-URL: https://drops.dagstuhl.de/opus/volltexte/2020/12931/
https://drops.dagstuhl.de/opus/volltexte/2020/12931/pdf/LIPIcs-ESA-2020-65.pdf/
https://dblp.uni-trier.de/db/journals/corr/corr2005.html#abs-2005-03986
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.65

KERNELIZATION ALGORITHMS FOR A GENERALIZATION OF THE COMPONENT ORDER CONNECTIVITY PROBLEM

Autoren: Masataka Shirahashi Naoyuki Kamiyama

Quelle: Journal of the Operations Research Society of Japan. 66:112-129

On optimal streaming kernelization algorithms

Autoren: Hao Feng Wei Yang Jianer Chen

Quelle: Science China Information Sciences. 67

Bloomfilter-Based Practical Kernelization Algorithms for Minimum Satisfiability

Autoren: Chao Xu Liting Dai Kang Liu

Quelle: Communications in Computer and Information Science ISBN: 9789819981373

Exact and kernelization algorithms for Closet String

Autoren: Omar Latorre

Quelle: Selecciones Matemáticas, Vol 7, Iss 02, Pp 257-266 (2020)
Selecciones Matemáticas; Vol. 7 Núm. 02 (2020): Agosto-Diciembre; 257-266
Selecciones Matemáticas; Vol. 7 No. 02 (2020): Agosto-Diciembre; 257-266
Selecciones Matemáticas; v. 7 n. 02 (2020): Agosto-Diciembre; 257-266
Revistas-Universidad Nacional de Trujillo
Universidad Nacional de Trujillo
instacron:UNITRU

Schlagwörter: closest string problem, T57-57.97, Applied mathematics. Quantitative methods, Algoritmo de parámetro fijo, Closest String Problem, Optimización combinatoria, exact algorithm, Exact Algorithm, Fixed Parameter Algorithm, Kernelización, Combinatorial Optimization, Algoritmo exacto, fixed parameter algorithm, kernelization, QA1-939, Kernelization, Problema de la subsecuencia de caracteres más próxima, combinatorial optimization, Mathematics

Dateibeschreibung: application/pdf

Zugangs-URL: https://revistas.unitru.edu.pe/index.php/SSMM/article/download/3080/3935
https://doaj.org/article/ff3d2326a53c4c2fb311435969b31b44
https://revistas.unitru.edu.pe/index.php/SSMM/article/view/3080

Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big Data.

Autoren: Chen, Jianer Huang, Qin Kanj, Iyad et al.

Quelle: Algorithmica. Aug2024, Vol. 86 Issue 8, p2448-2478. 31p.

Schlagwörter: *POLYNOMIAL time algorithms, *TIME complexity, *DETERMINISTIC algorithms, *NP-hard problems, *COMPLEXITY (Philosophy), *BIG data

FPT and Kernelization Algorithms for the Induced Tree Problem

Autoren: Guilherme Castro Mendes Gomes Vinicius F. dos Santos Murilo V. G. da Silva et al.

Quelle: Lecture Notes in Computer Science ISBN: 9783030752415

Zugangs-URL: https://link.springer.com/chapter/10.1007/978-3-030-75242-2_11
https://link.springer.com/content/pdf/10.1007%2F978-3-030-75242-2_11.pdf
https://rd.springer.com/chapter/10.1007/978-3-030-75242-2_11

Exploiting $\mathbf{c}$-Closure in Kernelization Algorithms for Graph Problems

Autoren: Koana, Tomohiro Komusiewicz, Christian Sommer, Frank

Index Begriffe: Computer Science - Discrete Mathematics, text

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

FPT and kernelization algorithms for the k-in-a-tree problem

Autoren: Gomes, Guilherme C. M. Santos, Vinicius F. dos da Silva, Murilo V. G. et al.

Schlagwörter: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 01 natural sciences

Zugangs-URL: http://arxiv.org/abs/2007.04468

An overview of kernelization algorithms for graph modification problems

Autoren: Wang Jian-xin Liu Yunlong Guo Jiong

Quelle: Tsinghua Science and Technology. 19:346-357

Schlagwörter: 0102 computer and information sciences, 01 natural sciences, 6. Clean water

Zugangs-URL: https://ieeexplore.ieee.org/ielx7/5971803/6867510/06867517.pdf
http://tst.tsinghuajournals.com/EN/Y2014/V19/I4/346
http://www.tsinghuajournals.com/tst/EN/abstract/abstract148377.shtml

Exploiting c-Closure in Kernelization Algorithms for Graph Problems

Autoren: Koana, Tomohiro Komusiewicz, Christian Sommer, Frank

Index Begriffe: Fixed-parameter tractability, kernelization, c-closure, Dominating Set, Induced Matching, Irredundant Set, Ramsey numbers, Data processing Computer science, InProceedings, publishedVersion

Exact and kernelization algorithms for Closet String

Autoren: Latorre Vilca, Omar

Quelle: Selecciones Matemáticas, ISSN 2411-1783, Vol. 7, Nº. 2, 2020 (Ejemplar dedicado a: August - December), pags. 257-266

Index Begriffe: Closest String Problem, Combinatorial Optimization, Exact Algorithm, Fixed Parameter Algorithm, Kernelization, Problema de la subsecuencia de caracteres más próxima, Optimización combinatoria, Algoritmo exacto, Algoritmo de parámetro fijo, Kernelización, text (article)

URL: https://dialnet.unirioja.es/servlet/oaiart?codigo=8915755

Experimental evaluation of kernelization algorithms to Dominating Set

Autoren: Nadara, Wojciech

Schlagwörter: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 01 natural sciences

Zugangs-URL: http://arxiv.org/abs/1811.07831

Advanced kernelization algorithms

Autoren: Dániel Marx Łukasz Kowalik Fedor V. Fomin et al.

Quelle: Parameterized Algorithms ISBN: 9783319212746

Schlagwörter: 16. Peace & justice, 3. Good health

Zugangs-URL: https://link.springer.com/10.1007/978-3-319-21275-3_9
https://rd.springer.com/chapter/10.1007/978-3-319-21275-3_9
https://link.springer.com/chapter/10.1007/978-3-319-21275-3_9

An overview of different kernelization algorithms for the cluster editing problem

Autoren: Besseling, J.P. Bodlaender, H. L. (Thesis Advisor)

Index Begriffe: Bachelor Thesis, Student Thesis

URL: https://studenttheses.uu.nl/handle/20.500.12932/23423

Kernelization Algorithms for Packing Problems Allowing Overlaps

Autoren: Jazmín Romero Henning Fernau Alejandro López-Ortiz

Quelle: Lecture Notes in Computer Science ISBN: 9783319171418

Zugangs-URL: https://rd.springer.com/chapter/10.1007/978-3-319-17142-5_35
https://dblp.uni-trier.de/db/journals/corr/corr1411.html#FernauLR14
https://arxiv.org/abs/1411.6915
https://arxiv.org/pdf/1411.6915
https://link.springer.com/chapter/10.1007/978-3-319-17142-5_35
https://doi.org/10.1007/978-3-319-17142-5_35

Kernelization algorithms for the vertex cover problem

Autoren: Abu-Khzam, Faisal N. Collins, Rebecca L. Fellows, Micheal R. et al.

Index Begriffe: Conference Paper / Proceeding

URL: http://hdl.handle.net/10725/5409
http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php
http://www.siam.org/meetings/alenex04/abstacts/F-Abu-Khzam.pdf

On Parameterized and Kernelization Algorithms for the Hierarchical Clustering Problem

Autoren: Jianer Chen Yixin Cao

Quelle: Lecture Notes in Computer Science ISBN: 9783642382352

Zugangs-URL: https://rd.springer.com/chapter/10.1007/978-3-642-38236-9_29
https://link.springer.com/chapter/10.1007/978-3-642-38236-9_29
https://link.springer.com/content/pdf/10.1007%2F978-3-642-38236-9_29.pdf
https://dblp.uni-trier.de/db/conf/tamc/tamc2013.html#CaoC13
https://research.polyu.edu.hk/en/publications/on-parameterized-and-kernelization-algorithms-for-the-hierarchica

Parameterized Complexity of (d, r)-Domination via Modular Decomposition

Autoren: Cordasco G. Gargano L. Rescigno A. A.

Quelle: Lecture Notes in Computer Science ISBN: 9789819628445

Schlagwörter: FOS: Computer and information sciences, Computer Science - Computational Complexity, Discrete Mathematics (cs.DM), Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), Computational Complexity (cs.CC), Contamination minimization, Domination, Kernelization Algorithms, Parameterized Complexity, Computer Science - Discrete Mathematics

Zugangs-URL: http://arxiv.org/abs/2412.15671

Kernelization Algorithms

Autoren: Fedor V. Fomin

Quelle: Smart Innovation, Systems and Technologies ISBN: 9783642354519