Výsledky vyhledávání - "Theory of computation → Graph algorithms analysis phrases Parameterized complexity"

The Longest Run Subsequence Problem: Further Complexity Results

Autoři: Sikora, Florian Dondi, Riccardo Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision (LAMSADE) a další

Přispěvatelé: Sikora, Florian Dondi, Riccardo Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision (LAMSADE) a další

Zdroj: 32nd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2021, July 5-7, 2021, Wroc{\l}aw, Poland
32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021)
https://hal.science/hal-03457156
32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021), Jul 2021, Wrocław, Poland. ⟨10.4230/LIPIcs.CPM.2021.14⟩

Témata: Longest Subsequence, Approximation Hardness, Kernelization, Theory of computation → Graph algorithms analysis phrases Parameterized complexity, Theory of computation → Approximation algorithms analysis, 2012 ACM Subject Classification Theory of computation → Fixed parameter tractability, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]

Geografické téma: Wrocław, Poland

Dostupnost: https://hal.science/hal-03457156
https://doi.org/10.4230/LIPIcs.CPM.2021.14

The Longest Run Subsequence Problem: Further Complexity Results

Autoři: Sikora, Florian Dondi, Riccardo Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision (LAMSADE) a další

Přispěvatelé: Sikora, Florian Dondi, Riccardo Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision (LAMSADE) a další

Zdroj: 32nd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2021, July 5-7, 2021, Wroc{\l}aw, Poland
https://hal.archives-ouvertes.fr/hal-03457156
32nd Annual Symposium on Combinatorial Pattern Matching, 2021, July 5-7, 2021, Wrocaw, Poland, 2021, ⟨10.4230/LIPIcs.CPM.2021.14⟩

Témata: 2012 ACM Subject Classification Theory of computation → Fixed parameter tractability, Theory of computation → Approximation algorithms analysis, Theory of computation → Graph algorithms analysis phrases Parameterized complexity, Kernelization, Approximation Hardness, Longest Subsequence, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]

Relation: hal-03457156; https://hal.archives-ouvertes.fr/hal-03457156

Dostupnost: https://hal.archives-ouvertes.fr/hal-03457156
https://doi.org/10.4230/LIPIcs.CPM.2021.14