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

Orientable Burning Number of Graphs

Autoři: Julien Courtiel Paul Dorbec Tatsuya Gima a další

Přispěvatelé: Julien Courtiel Paul Dorbec Tatsuya Gima a další

Zdroj: Lecture Notes in Computer Science ISBN: 9789819705658

Témata: FOS: Computer and information sciences, burning number, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), fixed-parameter algorithm, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], graph orientation

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

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

Exact and kernelization algorithms for Closet String

Autoři: Omar Latorre

Zdroj: 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

Témata: 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

Popis souboru: application/pdf

Přístupová URL adresa: 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

Graph Motif Problems Parameterized by Dual

Autoři: Fertin, Guillaume Komusiewicz, Christian Guillaume Fertin and Christian Komusiewicz a další

Přispěvatelé: Fertin, Guillaume Komusiewicz, Christian Guillaume Fertin and Christian Komusiewicz a další

Zdroj: Journal of Graph Algorithms and Applications. 24:371-396

Témata: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], FOS: Computer and information sciences, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0206 medical engineering, lowerbounds, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, subgraph problem, Computer Science - Computational Complexity, kernelization, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), NP-hard problem, Combinatorics (math.CO), [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], ddc:004, fixed-parameter algorithm

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/1908.03870
https://hal.archives-ouvertes.fr/hal-01311579
https://dblp.uni-trier.de/db/conf/cpm/cpm2016.html#FertinK16
https://drops.dagstuhl.de/opus/volltexte/2016/6083/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2016.7

Polynomial fixed-parameter algorithms: A case study for longest path on interval graphs

Autoři: Giannopoulou, Archontia C. Mertzios, George B. Niedermeier, Rolf a další

Přispěvatelé: Giannopoulou, Archontia C. Mertzios, George B. Niedermeier, Rolf a další

Zdroj: Theoretical computer science, 2017, Vol.689, pp.67-95 [Peer Reviewed Journal]
Husfeldt, Thore & Kanj, Iyad (Eds.). (2015). 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). : Leibniz International Proceedings in Informatics, pp. 102-113, LIPIcs : Leibniz international proceedings in informatics(43)

Témata: FOS: Computer and information sciences, G.2.2, F.2.2, G.2.1, proper interval vertex del, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, Longest path problem, 0202 electrical engineering, electronic engineering, information engineering, Proper interval vertex deletion set, fixed-parameter algorithm, preprocessing, Preprocessing, Data reduction, Polynomialtime algorithm, polynomial-time algorithm, longest path problem, Computer Science - Computational Complexity, Fixed-parameter algorithm, Interval graphs, data reduction, interval graphs, ddc:004

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/1506.01652
https://www.sciencedirect.com/science/article/pii/S030439751730422X
https://dro.dur.ac.uk/21953/
https://doi.org/10.1016/j.tcs.2017.05.017
https://www.sciencedirect.com/science/article/abs/pii/S030439751730422X
https://core.ac.uk/display/83925076
https://dblp.uni-trier.de/db/journals/tcs/tcs689.html#GiannopoulouMN17
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.102

A Fixed-Parameter Algorithm for Scheduling Unit dependent Tasks with Unit Communication Delays

Autoři: Tang, Ning Kordon, Alix, Munier Peking University Beijing a další

Přispěvatelé: Tang, Ning Kordon, Alix, Munier Peking University Beijing a další

Zdroj: Euro-Par 2021 - 27th International European Conference on Parallel and Distributed Computing ; https://hal.science/hal-03816158 ; Euro-Par 2021 - 27th International European Conference on Parallel and Distributed Computing, Aug 2021, Lisbon, Portugal. pp.105-119, ⟨10.1007/978-3-030-85665-6_7⟩

Témata: scheduling, communication delays, makespan, fixed-parameter algorithm, [INFO]Computer Science [cs]

Geografické téma: Lisbon, Portugal

Dostupnost: https://hal.science/hal-03816158
https://hal.science/hal-03816158v1/document
https://hal.science/hal-03816158v1/file/EuroPar.pdf
https://doi.org/10.1007/978-3-030-85665-6_7

Fixed Parameter Algorithms and Hardness of Approximation Results for the Structural Target Controllability Problem

Autoři: Czeizler, Eugen Popa, Alexandru Popescu, Victor

Zdroj: Czeizler, E, Popa, A & Popescu, V 2022, 'Fixed Parameter Algorithms and Hardness of Approximation Results for the Structural Target Controllability Problem', Scientific Annals of Computer Science, vol. 32, no. 1, pp. 109-136. https://doi.org/10.7561/SACS.2022.1.109

Témata: Fixed parameter algorithm, Linear networks, Network control, NP-hardness, Optimization algorithm, Structural control

Popis souboru: application/pdf

Relation: info:eu-repo/semantics/altIdentifier/pissn/1843-8121; info:eu-repo/semantics/altIdentifier/eissn/2248-2695

Dostupnost: https://research.abo.fi/en/publications/8c0c0727-772f-4c54-8817-6bce966efe13
https://doi.org/10.7561/SACS.2022.1.109
https://research.abo.fi/ws/files/50028613/XXXII1_3_1.pdf
https://www.scopus.com/pages/publications/85134027609
https://urn.fi/URN:NBN:fi-fe2023030329497

New algorithms for maximum disjoint paths based on tree-likeness

Autoři: Krzysztof Fleszar Matthias Mnich Joachim Spoerhase a další

Přispěvatelé: Krzysztof Fleszar Matthias Mnich Joachim Spoerhase a další

Zdroj: Math Program
24th Annual European Symposium on Algorithms
Leibniz International Proceedings in Informatics
Mathematical Programming / A

Témata: FOS: Computer and information sciences, Full Length Paper, FLOW, INTEGER, feedback vertex set, Approximation algorithm, disjoint paths, Fixed-parameter algorithm, Computer Science - Data Structures and Algorithms, THEOREM, Data Structures and Algorithms (cs.DS), Disjoint paths, ddc:004, approximation algorithms, Feedback vertex set

Popis souboru: application/pdf

Přístupová URL adresa: https://europepmc.org/articles/pmc6417437?pdf=render
https://pubmed.ncbi.nlm.nih.gov/30956356
http://arxiv.org/abs/1603.01740
https://pure.mpg.de/pubman/item/item_2554144_5/component/file_2554143/s10107-017-1199-3.pdf
https://link.springer.com/content/pdf/10.1007%2Fs10107-017-1199-3.pdf
https://europepmc.org/article/MED/30956356
https://cris.maastrichtuniversity.nl/portal/en/publications/new-algorithms-for-maximum-disjoint-paths-based-on-treelikeness(588b52c0-6f9c-4b01-b412-cf602ca3bab7).html
https://www.narcis.nl/publication/RecordID/oai%3Acris.maastrichtuniversity.nl%3Apublications%2F588b52c0-6f9c-4b01-b412-cf602ca3bab7
https://link.springer.com/article/10.1007/s10107-017-1199-3
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.42
http://hdl.handle.net/21.11116/0000-0000-B55C-D
http://hdl.handle.net/21.11116/0000-0000-B54C-F
http://hdl.handle.net/21.11116/0000-0000-B54E-D

Exact and kernelization algorithms for Closet String ; Algoritmos exacto y de kernelización para el problema de la subsecuencia de caracteres más próxima

Autoři: Latorre Vilca, Omar

Zdroj: Selecciones Matemáticas; Vol. 7 No. 02 (2020): August - December; 257-266 ; Selecciones Matemáticas; Vol. 7 Núm. 02 (2020): Agosto-Diciembre; 257-266 ; Selecciones Matemáticas; v. 7 n. 02 (2020): Agosto-Diciembre; 257-266 ; 2411-1783

Témata: 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

Popis souboru: application/pdf

Relation: https://revistas.unitru.edu.pe/index.php/SSMM/article/view/3080/3935; https://revistas.unitru.edu.pe/index.php/SSMM/article/view/3080

Dostupnost: https://revistas.unitru.edu.pe/index.php/SSMM/article/view/3080

Coloring immersion-free graphs

Autoři: Naonori Kakimura Ken-ichi Kawarabayashi

Zdroj: Journal of Combinatorial Theory, Series B. 121:284-307

Témata: immersion, Coloring of graphs and hypergraphs, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Graph minors, 0102 computer and information sciences, fixed-parameter algorithm, 0101 mathematics, 01 natural sciences, coloring

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/6637924
https://doi.org/10.1016/j.jctb.2016.07.005

Reconciling multiple genes trees via segmental duplications and losses

Autoři: Dondi, Riccardo Laxmi Parida Esko Ukkonen a další

Přispěvatelé: Dondi, Riccardo Laxmi Parida Esko Ukkonen a další

Témata: Computational complexity, Fixed-parameter algorithm, Gene trees/species tree reconciliation, Phylogenetic, Software, Settore INF/01 - Informatica

Popis souboru: optical disk

Relation: info:eu-repo/semantics/altIdentifier/isbn/9783959770828; ispartofbook:18th International Workshop on Algorithms in Bioinformatics : WABI 2018, August 20–22, 2018, Helsinki, Finland; WABI 2018: 18th International Workshop on Algorithms in Bioinformatics, Helsinki, Finland, 20-22 August 2018; volume:113; issue:art. n. 5; firstpage:1; lastpage:16; serie:LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS; alleditors:Laxmi Parida; Esko Ukkonen; http://hdl.handle.net/10446/132416

Dostupnost: http://hdl.handle.net/10446/132416
https://doi.org/10.4230/LIPIcs.WABI.2018.5

A Cubic-Vertex Kernel for Flip Consensus Tree

Autoři: Komusiewicz, Christian Uhlmann, Johannes Christian Komusiewicz and Johannes Uhlmann a další

Přispěvatelé: Komusiewicz, Christian Uhlmann, Johannes Christian Komusiewicz and Johannes Uhlmann a další

Zdroj: Algorithmica. 68:81-108

Témata: problem kernel, Fixed-parameter algorithm, [INFO]Computer Science [cs], NP-hard problem, 0102 computer and information sciences, ddc:004, 01 natural sciences, computational phylogenetics, graph modification problem

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/opus/volltexte/2008/1760/pdf/08004.KomusiebiczChristian.1760.pdf
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1760

A Fixed-Parameter Algorithm for Detecting a Singleton Attractor in an AND/OR Boolean Network with Bounded Treewidth

Autoři: CHANG, Chia-Jung TAMURA, Takeyuki CHAO, Kun-Mao a další

Přispěvatelé: CHANG, Chia-Jung TAMURA, Takeyuki CHAO, Kun-Mao a další

Zdroj: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. :384-390

Témata: 0301 basic medicine, attractor, 03 medical and health sciences, 0206 medical engineering, Boolean network, 02 engineering and technology, fixed-parameter algorithm, partial k-tree

Popis souboru: application/pdf

Přístupová URL adresa: https://repository.kulib.kyoto-u.ac.jp/dspace/bitstream/2433/198463/1/transfun.E98.A.384.pdf
https://www.jstage.jst.go.jp/article/transfun/E98.A/1/E98.A_384/_article
https://dblp.uni-trier.de/db/journals/ieicet/ieicet98a.html#ChangTCA15
https://ui.adsabs.harvard.edu/abs/2015IEITF..98..384C/abstract
http://search.ieice.org/bin/summary.php?id=e98-a_1_384
http://ci.nii.ac.jp/naid/130004770922

Pure Parsimony Xor Haplotyping

Autoři: BONIZZONI, PAOLA DELLA VEDOVA, GIANLUCA Dondi, R a další

Zdroj: Lecture Notes in Computer Science ISBN: 9783642015502

Témata: haplotype resolution, xor-genotype data, haplotype inference, SNP, HapMap project, FOS: Computer and information sciences, 0301 basic medicine, Heterozygote, Genotype, Algorithms, approximation algorithms, graph representation, pure parsimony, 0206 medical engineering, Computational Biology, 02 engineering and technology, haplotyping, Polymorphism, Single Nucleotide, Computational Engineering, Finance, and Science (cs.CE), 03 medical and health sciences, Haplotypes, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), fixed-parameter algorithm, Computer Science - Computational Engineering, Finance, and Science

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/pdf/1001.1210
https://pubmed.ncbi.nlm.nih.gov/20498511
http://arxiv.org/abs/1001.1210
https://dblp.uni-trier.de/db/conf/isbra/isbra2009.html#BonizzoniVDPR09
https://link.springer.com/chapter/10.1007%2F978-3-642-01551-9_19
https://aisberg.unibg.it/handle/10446/23650
https://iris.univr.it/handle/11562/409549
https://rd.springer.com/chapter/10.1007/978-3-642-01551-9_19
https://boa.unimib.it/handle/10281/6280
http://europepmc.org/abstract/MED/20498511
https://aisberg.unibg.it/handle/10446/24353
https://www.infona.pl/resource/bwmeta1.element.ieee-art-000005473211
https://dblp.uni-trier.de/db/journals/corr/corr1001.html#abs-1001-1210
https://pubmed.ncbi.nlm.nih.gov/20498511/
https://www.ncbi.nlm.nih.gov/pubmed/20498511
https://hdl.handle.net/10281/6280
https://doi.org/10.1007/978-3-642-01551-9_19
https://hdl.handle.net/10446/24353
https://doi.org/10.1109/TCBB.2010.52
https://hdl.handle.net/10446/23650
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=5473211
https://doi.org/10.1109/TCBB.2010.52
https://hdl.handle.net/11562/409575
https://hdl.handle.net/11562/409549

The longest filled common subsequence problem

Autoři: Castelli, M Dondi, R MAURI, GIANCARLO a další

Přispěvatelé: Castelli, M Dondi, R MAURI, GIANCARLO a další

Témata: Approximation algorithm, Computational complexity, Fixed-parameter algorithm, Longest common subsequence, Settore INFO-01/A - Informatica

Relation: info:eu-repo/semantics/altIdentifier/isbn/9783959770392; ispartofbook:Proceedings CPM 2017 – 28th Annual Symposium on Combinatorial Pattern Matching; 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017; volume:78; firstpage:1; lastpage:14; numberofpages:14; serie:LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS; alleditors:Kärkkäinen, J; Radoszewski, J; Rytter, W; https://hdl.handle.net/10281/168555; http://drops.dagstuhl.de/opus/institut_lipics.php?fakultaet=04

Dostupnost: https://hdl.handle.net/10281/168555
https://doi.org/10.4230/LIPIcs.CPM.2017.14
http://drops.dagstuhl.de/opus/institut_lipics.php?fakultaet=04

Treedepth Parameterized by Vertex Cover Number

Autoři: Kobayashi, Yasuaki Tamaki, Hisao Yasuaki Kobayashi and Hisao Tamaki

Přispěvatelé: Kobayashi, Yasuaki Tamaki, Hisao Yasuaki Kobayashi and Hisao Tamaki

Témata: Fixed-parameter algorithm, Polynomial kernelization, Structural parameterization, Treedepth, Vertex cover

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 63, 11th International Symposium on Parameterized and Exact Computation (IPEC 2016); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.18

Dostupnost: https://doi.org/10.4230/LIPIcs.IPEC.2016.18
https://nbn-resolving.org/urn:nbn:de:0030-drops-69438
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.18

New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem

Autoři: Chang, Maw-Shang Lin, Chuang-Chieh Rossmanith, Peter

Zdroj: Lecture Notes in Computer Science ISBN: 9783540797227

Témata: Evolutionary tree, Quartet topology, Leaf-labeled tree, Minimum quartet inconsistency problem, Fixed-parameter algorithm, Depth-bounded search tree, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 14. Life underwater, 15. Life on land, 16. Peace & justice, 01 natural sciences

Popis souboru: 107 bytes; text/html

Přístupová URL adresa: https://rd.springer.com/chapter/10.1007/978-3-540-79723-4_8
https://link.springer.com/content/pdf/10.1007%2F978-3-540-79723-4_8.pdf
https://link.springer.com/chapter/10.1007%2F978-3-540-79723-4_8
https://dblp.uni-trier.de/db/conf/iwpec/iwpec2008.html#ChangLR08

The Traveling Salesman Problem with Few Inner Points: The traveling salesman problem with few inner points

Autoři: Vladimir G. Deineko Michael Hoffmann Gerhard J. Woeginger a další

Zdroj: Lecture Notes in Computer Science ISBN: 9783540228561

Témata: Combinatorial optimization, traveling salesman, 0211 other engineering and technologies, exact algorithm, 0102 computer and information sciences, 02 engineering and technology, METIS-219802, fixed-parameter algorithm, parameterization, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://research.utwente.nl/en/publications/1f63ee94-01f0-4fd5-9dc9-80e463a1c813
https://dl.acm.org/doi/10.1016/j.orl.2005.01.002
https://dblp.uni-trier.de/db/journals/orl/orl34.html#DeinekoHOW06
https://doi.org/10.1016/j.orl.2005.01.002
https://www.sciencedirect.com/science/article/pii/S0167637705000076
https://www.narcis.nl/publication/RecordID/oai%3Apure.tue.nl%3Apublications%2F7c4abf9d-8e63-45e2-b0ba-770321d27561
https://core.ac.uk/display/20707598
https://link.springer.com/chapter/10.1007/978-3-540-27798-9_30
https://rd.springer.com/chapter/10.1007/978-3-540-27798-9_30
https://research.utwente.nl/en/publications/the-travelling-salesman-problem-with-few-inner-points
https://dblp.uni-trier.de/db/conf/cocoon/cocoon2004.html#DeinekoHOW04
https://link.springer.com/content/pdf/10.1007%2F978-3-540-27798-9_30.pdf

Graph Motif Problems Parameterized by Dual

Autoři: Fertin, Guillaume Komusiewicz, Christian Guillaume Fertin and Christian Komusiewicz

Přispěvatelé: Fertin, Guillaume Komusiewicz, Christian Guillaume Fertin and Christian Komusiewicz

Témata: NP-hard problem, subgraph problem, fixed-parameter algorithm, lowerbounds, kernelization

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 54, 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2016.7

Dostupnost: https://doi.org/10.4230/LIPIcs.CPM.2016.7
https://nbn-resolving.org/urn:nbn:de:0030-drops-60837
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2016.7

Charge and reduce: A fixed-parameter algorithm for String-to-String Correction

Autoři: Abu-Khzam, Faisal N. Fernau, Henning Langston, Micheal A. a další

Zdroj: Discrete Optimization. 8:41-49

Témata: String-to-String Correction, Charge and reduce, Computational Theory and Mathematics, Fixed-parameter algorithm, Applied Mathematics, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Theoretical Computer Science

Přístupová URL adresa: https://researchers.cdu.edu.au/en/publications/charge-and-reduce-a-fixed-parameter-algorithm-for-string-to-strin
https://doi.org/10.1016/j.disopt.2010.10.003
https://www.sciencedirect.com/science/article/abs/pii/S1572528610000708
https://dblp.uni-trier.de/db/journals/disopt/disopt8.html#Abu-KhzamFLLS11
https://laur.lau.edu.lb:8443/xmlui/handle/10725/2773
https://core.ac.uk/display/81141209