Image de couverture de livre

FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Lanzinger, Matthias, Razgon, Igor
Format:	Preprint
Publié:	2023
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

FPT Parameterisations of Fractional and Generalised Hypertree Width
par: Lanzinger, Matthias, et autres
Publié: (2025)

Cuts and Gauges for Submodular Width
par: Lanzinger, Matthias
Publié: (2026)

FPT Approximations for Connected Maximum Coverage
par: Inamdar, Tanmay, et autres
Publié: (2026)

FPT Approximation for Capacitated Sum of Radii
par: Jaiswal, Ragesh, et autres
Publié: (2024)

Maximum Unique Coverage on Streams: Improved FPT Approximation Scheme and Tighter Space Lower Bound
par: Cervenjak, Philip, et autres
Publié: (2024)

Optimal FPT-Approximability for Modular Linear Equations
par: Dabrowski, Konrad K., et autres
Publié: (2026)

Improved FPT Approximation for Non-metric TSP
par: Bampis, Evripidis, et autres
Publié: (2024)

FPT Approximations for Fair $k$-Min-Sum-Radii
par: Carta, Lena, et autres
Publié: (2024)

An FPT Constant-Factor Approximation Algorithm for Correlation Clustering
par: Zhou, Jianqi, et autres
Publié: (2025)

Efficient Approximation of Fractional Hypertree Width
par: Korchemna, Viktoriia, et autres
Publié: (2024)

On Tight FPT Time Approximation Algorithms for k-Clustering Problems
par: Dai, Han, et autres
Publié: (2025)

FPT Approximations for Fair Sum of Radii with Outliers and General Norm Objectives
par: Gadekar, Ameet
Publié: (2026)

Hypergraph dualization with FPT-delay parameterized by the degeneracy and dimension
par: Bartier, Valentin, et autres
Publié: (2023)

Approximation and FPT Algorithms for Finding DM-Irreducible Spanning Subgraphs
par: Norose, Ryoma, et autres
Publié: (2024)

Approximation Algorithms for Digraph Width Parameters
par: Kintali, Shiva, et autres
Publié: (2011)

Improved FPT Approximation Scheme and Approximate Kernel for Biclique-Free Max k-Weight SAT: Greedy Strikes Back
par: Manurangsi, Pasin
Publié: (2024)

FPT Constant Approximation Algorithms for Colorful Sum of Radii
par: Liu, Shuilian, et autres
Publié: (2025)

Parameterized Algorithms for Steiner Forest in Bounded Width Graphs
par: Feldmann, Andreas Emil, et autres
Publié: (2024)

When does FTP become FPT?
par: Bentert, Matthias, et autres
Publié: (2025)

FPT approximations for Capacitated Sum of Radii and Diameters
par: Filtser, Arnold, et autres
Publié: (2024)

An FPT algorithm for Matching Cut and d-cut
par: Aravind, N R, et autres
Publié: (2021)

Faster Approximate Linear Matroid Intersection
par: Terao, Tatsuya
Publié: (2026)

Almost Tight Bounds for Online Hypergraph Matching
par: Tröbst, Thorben, et autres
Publié: (2024)

FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii
par: Bandyapadhyay, Sayan, et autres
Publié: (2023)

Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems
par: Eisenbrand, Friedrich, et autres
Publié: (2024)

FPT algorithms over linear delta-matroids with applications
par: Eiben, Eduard, et autres
Publié: (2025)

FPT Approximation Schemes for Min-Sum Radii and Min-Sum Diameters Clustering
par: Grandoni, Fabrizio, et autres
Publié: (2026)

Subsequences With Generalised Gap Constraints: Upper and Lower Complexity Bounds
par: Manea, Florin, et autres
Publié: (2024)

ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines
par: Rohwedder, Lars
Publié: (2025)

Pushing the frontiers of subexponential FPT time for Feedback Vertex Set
par: Berthe, Gaétan, et autres
Publié: (2025)

A Single Exponential-Time FPT Algorithm for Cactus Contraction
par: Krithika, R., et autres
Publié: (2025)

Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths
par: Bentert, Matthias, et autres
Publié: (2024)

Efficient Hypergraph Pattern Matching via Match-and-Filter and Intersection Constraint
par: Song, Siwoo, et autres
Publié: (2025)

Almost-Tight Bounds on Preserving Cuts in Classes of Submodular Hypergraphs
par: Khanna, Sanjeev, et autres
Publié: (2024)

Near-optimal Hypergraph Sparsification in Insertion-only and Bounded-deletion Streams
par: Khanna, Sanjeev, et autres
Publié: (2025)

FPT Algorithms using Minimal Parameters for a Generalized Version of Maximin Shares
par: Jansen, Klaus, et autres
Publié: (2024)

Universal Hirschberg for Width Bounded Dynamic Programs
par: Nye, Logan
Publié: (2025)

Approximation Algorithms for Matroid-Intersection Coloring with Applications to Rota's Basis Conjecture
par: Arndt, Stephen, et autres
Publié: (2026)

An ETH-Tight FPT Algorithm for Rejection-Proof Set Packing with Applications to Kidney Exchange
par: Jansen, Bart M. P., et autres
Publié: (2025)

FPT Approximation using Treewidth: Capacitated Vertex Cover, Target Set Selection and Vector Dominating Set
par: Chu, Huairui, et autres
Publié: (2023)