Výsledky vyhledávání - fixed-parameter tractable algorithms~

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 tractable algorithms for Tracking Shortest Paths

Autoři: Aritra Banik Pratibha Choudhary Venkatesh Raman a další

Zdroj: Theoretical Computer Science. 846:1-13

Témata: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Přístupová URL adresa: http://arxiv.org/pdf/2001.08977
http://arxiv.org/abs/2001.08977
https://jglobal.jst.go.jp/detail?JGLOBAL_ID=202002290799526426
https://ui.adsabs.harvard.edu/abs/2020arXiv200108977B/abstract
https://www.sciencedirect.com/science/article/abs/pii/S0304397520305053
http://dblp.uni-trier.de/db/journals/corr/corr2001.html#abs-2001-08977
https://doi.org/10.1016/j.tcs.2020.09.006
https://dblp.uni-trier.de/db/journals/corr/corr2001.html#abs-2001-08977

Fixed-Parameter Tractable Algorithms for Rejection-Proof Kidney Exchange

Autoři: Lamme, Jeroen S.K.

Témata: Master

URL: https://pure.tue.nl/ws/files/351955360/Lamme_J.pdf
https://pure.tue.nl/ws/files/351955360/Lamme_J.pdf

Fixed-Parameter Tractable Algorithms on Directed Graphs using H-Treewidth

Autoři: Gorissen, Bart J.M.

Témata: Master

URL: https://pure.tue.nl/ws/files/350971700/Gorissen_B.pdf
https://pure.tue.nl/ws/files/350971700/Gorissen_B.pdf

Near-Linear Time and Fixed-Parameter Tractable Algorithms for Tensor Decompositions

Autoři: Mahankali, Arvind V. Woodruff, David P. Zhang, Ziyu a další

Přispěvatelé: Mahankali, Arvind V. Woodruff, David P. Zhang, Ziyu a další

Témata: FOS: Computer and information sciences, Computer Science - Machine Learning, Tensor decomposition, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Low rank approximation, Sketching algorithms, Machine Learning (cs.LG)

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2207.07417
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.79

Faster Fixed Parameter Tractable Algorithms for Counting Markov Equivalence Classes with Special Skeletons

Autoři: Sharma, Vidya Sagar

Témata: Computer Science - Data Structures and Algorithms, text

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

Fixed Parameter Tractable Algorithms for Watchman Route Related Problems on Rectilinear Line Segment Arrangements

Autoři: Remi Raman Shahin John J S Subashini R a další

Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs

Autoři: Pradeesha Ashok Saket Saurabh Sudeshna Kolay a další

Zdroj: SIAM Journal on Discrete Mathematics. 32:1189-1208

Témata: Maximization algorithms, Conflict-free coloring, 0102 computer and information sciences, FPT algorithms, 01 natural sciences, Unique-maximum coloring

Přístupová URL adresa: https://pure.tue.nl/ws/files/102167270/16m1107462.pdf
https://dblp.uni-trier.de/db/journals/siamdm/siamdm32.html#AshokDKS18
https://doi.org/10.1137/16M1107462
https://epubs.siam.org/doi/10.1137/16M1107462
https://locus.siam.org/doi/abs/10.1137/16M1107462

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

Near-Linear Time and Fixed-Parameter Tractable Algorithms for Tensor Decompositions

Autoři: Mahankali, Arvind V. Woodruff, David P. Zhang, Ziyu a další

Přispěvatelé: Mahankali, Arvind V. Woodruff, David P. Zhang, Ziyu a další

Témata: Low rank approximation, Sketching algorithms, Tensor decomposition

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 287, 15th Innovations in Theoretical Computer Science Conference (ITCS 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.79

Dostupnost: https://doi.org/10.4230/LIPIcs.ITCS.2024.79
https://nbn-resolving.org/urn:nbn:de:0030-drops-196078
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.79

Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases: complexity, approximation and fixed parameter tractable algorithms, and some special cases

Autoři: Weller, Mathias Chateau, Annie Dallard, Clément a další

Přispěvatelé: Weller, Mathias Chateau, Annie Dallard, Clément a další

Zdroj: Weller, M, Chateau, A, Dallard, C & Giroudeau, R 2018, ' Scaffolding problems revisited: complexity, approximation and fixed parameter tractable algorithms, and some special cases ', Algorithmica, vol. 80 . https://doi.org/10.1007/s00453-018-0405-x

Témata: 0301 basic medicine, 0303 health sciences, 03 medical and health sciences, kernel, graph theory, scaffolding, bioinformatics, complexity, lower bound, {ISK4,wheel}-free graph, approximation, [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM]

Popis souboru: application/pdf; text/url

Přístupová URL adresa: https://hal.archives-ouvertes.fr/hal-01833303/file/hal_version.pdf
https://core.ac.uk/display/151190348
https://hal.archives-ouvertes.fr/hal-01833303
https://researchportal.port.ac.uk/en/publications/scaffolding-problems-revisited-complexity-approximation-and-fixed
https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica80.html#WellerCDG18
https://researchportal.port.ac.uk/portal/files/8690655/algorithmica.pdf
https://hal.archives-ouvertes.fr/hal-01833303/document
https://hal.science/hal-01833303v1
https://hal.science/hal-01833303v1/document
https://doi.org/10.1007/s00453-018-0405-x
https://researchportal.port.ac.uk/portal/en/publications/scaffolding-problems-revisited-complexity-approximation-and-fixed-parameter-tractable-algorithms-and-some-special-cases(e2b21b71-f616-42ba-a3f2-809766b5c645).html
https://repozitorij.upr.si/IzpisGradiva.php?id=12404
https://doi.org/10.1007/s00453-018-0405-x
https://hdl.handle.net/20.500.12556/RUP-12404

Fixed-Parameter Tractable Algorithms for Refined Parameterizations of Graph Problems

Autoři: van Roozendaal, Tom

Témata: Master, Master

URL: https://pure.tue.nl/ws/files/305626964/Roozendaal_T.pdf
https://pure.tue.nl/ws/files/305626964/Roozendaal_T.pdf

Finding Detours is Fixed-Parameter Tractable

Autoři: Ivona Bezáková Radu Curticapean Holger Dell a další

Přispěvatelé: Ivona Bezáková Radu Curticapean Holger Dell a další

Zdroj: SIAM Journal on Discrete Mathematics. 33:2326-2345

Témata: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), above-guarantee parameterization, QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány, 0102 computer and information sciences, 01 natural sciences, longest path, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, fixed-parameter tractable algorithms, graph minors, Computer Science - Discrete Mathematics

Popis souboru: application/pdf; text

Přístupová URL adresa: https://drops.dagstuhl.de/opus/volltexte/2017/7479/pdf/LIPIcs-ICALP-2017-54.pdf
http://arxiv.org/abs/1607.07737
https://arxiv.org/pdf/1607.07737.pdf
https://www.arxiv.org/abs/1607.07737
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.54
https://eprints.sztaki.hu/9221/

Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems

Autoři: Fellows, M. R. Knauer, C. Nishimura, N. a další

Přispěvatelé: Fellows, M. R. Knauer, C. Nishimura, N. a další

Zdroj: Lecture Notes in Computer Science ISBN: 9783540230250

Témata: graph matching, 4. Education, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, fixed parameter tractable, set packing, 7. Clean energy, 01 natural sciences, parameterized complexity, color coding

Přístupová URL adresa: https://dblp.uni-trier.de/db/conf/esa/esa2004.html#FellowsKNRRSTW04
https://core.ac.uk/display/24721390

Fixed-parameter tractable algorithms for Tracking Shortest Paths

Autoři: Banik, Aritra Choudhary, Pratibha Raman, Venkatesh a další

Témata: Computer Science - Data Structures and Algorithms, text

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

Fixed-Parameter Tractable Algorithms for Optimal Layout Decomposition and Beyond

Autoři: Jian Kuang Evangeline F. Y. Young

Zdroj: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 38:1731-1743

Témata: 2. Zero hunger, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Přístupová URL adresa: https://dl.acm.org/doi/pdf/10.1145/3061639.3062250
https://doi.org/10.1145/3061639.3062250
https://dblp.uni-trier.de/db/conf/dac/dac2017.html#0001Y17
https://dblp.uni-trier.de/db/journals/tcad/tcad38.html#KuangY19
https://doi.org/10.1109/TCAD.2018.2859255
https://ieeexplore.ieee.org/document/8418782

A general method to speed up fixed-parameter-tractable algorithms

Autoři: Peter Rossmanith Rolf Niedermeier

Zdroj: Information Processing Letters. 73:125-129

Témata: time complexity, Analysis of algorithms and problem complexity, 0211 other engineering and technologies, Complexity classes (hierarchies, relations among complexity classes, etc.), 0102 computer and information sciences, 02 engineering and technology, FTP algorithm, 15. Life on land, fixed-parameter-tractable algorithm, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1771749
https://doi.org/10.1016/s0020-0190(00)00004-1

Fixed-parameter tractable algorithms in graph theory

Autoři: Soleimanfallah, Arezou

Témata: 511

Přístupová URL adresa: http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.531326

Characterising parameterized graph classes : certifying algorithms for fixed-parameter tractable problems

Autoři: Wilson, Samuel Stuart Muller, Haiko Vuskovic, Kristina

Přispěvatelé: Wilson, Samuel Stuart Muller, Haiko Vuskovic, Kristina

Témata: 004

Přístupová URL adresa: https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.675011

Towards fixed-parameter tractable algorithms for abstract argumentation

Autoři: Stefan Woltran Wolfgang Dvořák Reinhard Pichler

Zdroj: Artificial Intelligence. 186:1-37

Témata: Tree-width, Artificial Intelligence, Fixed-parameter tractability, 0202 electrical engineering, electronic engineering, information engineering, Complexity, 0102 computer and information sciences, 02 engineering and technology, Dynamic programming, Abstract argumentation, 01 natural sciences