Suchergebnisse - "FPT algorithm"

Faster & Deterministic FPT Algorithm for Worst-Case Tensor Decomposition

Autoren: Bhargava, Vishwas Shringi, Devansh Vishwas Bhargava and Devansh Shringi

Weitere Verfasser: Bhargava, Vishwas Shringi, Devansh Vishwas Bhargava and Devansh Shringi

Schlagwörter: Tensor Rank, Tensor Decomposition, Algebraic circuits, Deterministic algorithms, ddc:004, Reconstruction, Learning circuits, FPT algorithm

Dateibeschreibung: application/pdf

Zugangs-URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.28

An FPT Algorithm for the Exact Matching Problem and NP-Hardness of Related Problems

Autoren: Murakami, Hitoshi Yamaguchi, Yutaro

Quelle: IEICE Transactions on Information and Systems. :214-220

Schlagwörter: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO)

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

Non-pool-based line planning: a practical analysis of the FPT algorithm tw-lines

Autoren: Bachtler, Oliver Heinrich, Irene Schiewe, Philine et al.

Weitere Verfasser: Bachtler, Oliver Heinrich, Irene Schiewe, Philine et al.

Quelle: Transportation Research Procedia. 86:290-297

Schlagwörter: fixed parameter tractability, treewidth, line planning

Dateibeschreibung: application/pdf

Zugangs-URL: https://aaltodoc.aalto.fi/handle/123456789/137110

ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines

Autoren: Rohwedder, Lars Lars Rohwedder

Weitere Verfasser: Rohwedder, Lars Lars Rohwedder

Schlagwörter: FOS: Computer and information sciences, Scheduling, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Integer Programming

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2501.04859
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.126

(Almost-)Optimal FPT Algorithm and Kernel for $T$-Cycle on Planar Graphs

Autoren: Gahlawat, Harmender Rathod, Abhishek Zehavi, Meirav et al.

Weitere Verfasser: Gahlawat, Harmender Rathod, Abhishek Zehavi, Meirav et al.

Schlagwörter: FOS: Computer and information sciences, FPT Algorithms, Discrete Mathematics (cs.DM), T-Cycle, Computer Science - Data Structures and Algorithms, Kernelization, Data Structures and Algorithms (cs.DS), Subexponential Algorithmms, ddc:004, Computer Science - Discrete Mathematics

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2504.19301
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.82

Approximation Algorithm and FPT Algorithm for Connected-k-Subgraph Cover on Minor-Free Graphs

Autoren: Pengcheng Liu Zhao Zhang Yingli Ran et al.

Quelle: Mathematical Structures in Computer Science. 34:180-192

Schlagwörter: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Congestion-Free Rerouting of Network Flows: Hardness and an FPT Algorithm

Autoren: Esra Ceylan Krishnendu Chatterjee Stefan Schmid et al.

Quelle: NOMS 2024-2024 IEEE Network Operations and Management Symposium. :1-7

An FPT algorithm for timeline cover

Autoren: Riccardo Dondi Manuel Lafond

Quelle: Journal of Computer and System Sciences. 154:103679

An ETH-Tight FPT Algorithm for Rejection-Proof Set Packing with Applications to Kidney Exchange

Autoren: Jansen, Bart M. P. Lamme, Jeroen S. K. Verhaegh, Ruben F. A.

Schlagwörter: FOS: Computer and information sciences, Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

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

A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs

Autoren: Madathil, Jayakrishnan Sharma, Roohani Zehavi, Meirav et al.

Weitere Verfasser: Madathil, Jayakrishnan Sharma, Roohani Zehavi, Meirav et al.

Quelle: Algorithmica. 83:1861-1884

Schlagwörter: bisection, polynomial kernel, splitters, 0102 computer and information sciences, ddc:004, fpt algorithm, chromatic coding, semicomplete digraph, 01 natural sciences, tournament

Dateibeschreibung: application/pdf

Zugangs-URL: https://drops.dagstuhl.de/opus/volltexte/2019/10972/pdf/LIPIcs-MFCS-2019-28.pdf
https://repository.iitgn.ac.in/handle/123456789/6334
https://link.springer.com/article/10.1007/s00453-021-00806-x
https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica83.html#MadathilSZ21
https://pure.mpg.de/pubman/faces/ViewItemOverviewPage.jsp?itemId=item_3293156
https://link.springer.com/content/pdf/10.1007/s00453-021-00806-x.pdf
https://doi.org/10.1007/s00453-021-00806-x
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.28

An $$\mathcal {O}(3.82^{k})$$ Time $$\textsf {FPT}$$ Algorithm for Convex Flip Distance

Autoren: Haohong Li Ge Xia

Quelle: Discrete & Computational Geometry. 73:702-718

An FPT Algorithm for Splitting a Necklace Among Two Thieves.

Autoren: Borzechowski, Michaela Schnider, Patrick Weber, Simon

Quelle: Algorithmica. Feb2026, Vol. 88 Issue 1, p1-19. 19p.

Schlagwörter: *NECKLACES, *COMPUTATIONAL complexity, *PROBLEM solving, *ALGORITHMS

An FPT Algorithm for the Exact Matching Problem and NP-hardness of Related Problems

Autoren: Murakami, Hitoshi Yamaguchi, Yutaro

Index Begriffe: Computer Science - Data Structures and Algorithms, Mathematics - Combinatorics, text

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

Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions.

Autoren: Alecu, Bogdan Kanté, Mamadou Moustapha Lozin, Vadim et al.

Quelle: Algorithmica. Feb2026, Vol. 88 Issue 1, p1-27. 27p.

Schlagwörter: *GRAPH theory, *ALGORITHMS, *SUBGRAPHS

Spy game: FPT-algorithm, hardness and graph products

Autoren: Eurinardo Rodrigues Costa Nicolas Almeida Martins Rudini Sampaio

Quelle: Theoretical Computer Science. 923:304-317

Schlagwörter: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

An FPT Algorithm for Splitting a Necklace Among Two Thieves

Autoren: Borzechowski, Michaela Schnider, Patrick Weber, Simon et al.

Weitere Verfasser: Borzechowski, Michaela Schnider, Patrick Weber, Simon et al.

Quelle: Leibniz International Proceedings in Informatics (LIPIcs), 283
34th International Symposium on Algorithms and Computation (ISAAC 2023)

Schlagwörter: Computational Geometry (cs.CG), FOS: Computer and information sciences, FPT, Computational Complexity (cs.CC), Necklace splitting, Computer Science - Computational Complexity, well-separation, Computer Science - Data Structures and Algorithms, n-separability, FOS: Mathematics, Mathematics - Combinatorics, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), ham sandwich, Combinatorics (math.CO), ddc:004

Dateibeschreibung: application/pdf; application/application/pdf

Zugangs-URL: http://arxiv.org/abs/2306.14508
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.15
http://hdl.handle.net/20.500.11850/647850

Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions

Autoren: Alecu, Bogdan Kanté, Mamadou Moustapha Lozin, Vadim et al.

Index Begriffe: Mathematics - Combinatorics, Computer Science - Discrete Mathematics, Computer Science - Data Structures and Algorithms, text

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

An FPT Algorithm for Spanning Trees with Few Branch Vertices Parameterized by Modular-Width

Autoren: Gargano L. Rescigno A. A. Luisa Gargano and Adele A. Rescigno

Weitere Verfasser: Gargano L. Rescigno A. A. Luisa Gargano and Adele A. Rescigno

Schlagwörter: Fixed-parameter tractable algorithms, Spanning Trees, ddc:004, Modular-width, Branch vertices

Dateibeschreibung: application/pdf

Zugangs-URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.50

An FPT Algorithm for Bipartite Vertex Splitting

Autoren: Reyan Ahmed Stephen Kobourov Myroslav Kryven

Quelle: Lecture Notes in Computer Science ISBN: 9783031222023

Schlagwörter: Computational Geometry (cs.CG), FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Computer Science - Computational Geometry, 0102 computer and information sciences, 01 natural sciences, Computer Science - Discrete Mathematics

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

An ?(3.82^k) Time FPT Algorithm for Convex Flip Distance

Autoren: Li, Haohong Xia, Ge

Index Begriffe: Flip distance, Rotation distance, Triangulations, Exact algorithms, Parameterized complexity, Data processing Computer science, InProceedings, publishedVersion

URL: https://drops.dagstuhl.de/opus/volltexte/2023/17696/