Image de couverture de livre

An FPT algorithm for Matching Cut and d-cut

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Aravind, N R, Saxena, Roopam
Format:	Preprint
Publié:	2021
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

Parameterized Complexity of Path Set Packing
par: Aravind, N. R., et autres
Publié: (2022)

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

An FPT Algorithm for the Exact Matching Problem and NP-hardness of Related Problems
par: Murakami, Hitoshi, et autres
Publié: (2024)

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)

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

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

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

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

Minimum+1 Steiner Cuts and Dual Edge Sensitivity Oracle: Bridging the Gap between Global cut and (s,t)-cut
par: Bhanja, Koustav
Publié: (2024)

Streaming Algorithms via Local Algorithms for Maximum Directed Cut
par: Saxena, Raghuvansh R., et autres
Publié: (2024)

Split-or-decompose: Improved FPT branching algorithms for maximum agreement forests
par: Mestel, David, et autres
Publié: (2024)

Online Dependent Rounding Schemes for Bipartite Matchings, with Applications
par: Joseph, et autres
Publié: (2023)

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

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

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

Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions
par: Alecu, Bogdan, et autres
Publié: (2024)

Matching (Multi)Cut: Algorithms, Complexity, and Enumeration
par: Gomes, Guilherme C. M., et autres
Publié: (2024)

FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs
par: Lanzinger, Matthias, et autres
Publié: (2023)

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)

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)

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

Proportionally Fair Matching via Randomized Rounding
par: Duppala, Sharmila, et autres
Publié: (2024)

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

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

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

An approximation algorithm for Maximum DiCut vs. Cut
par: Nakajima, Tamio-Vesa, 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)

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

A simpler and parallelizable $O(\sqrt{\log n})$-approximation algorithm for Sparsest Cut
par: Kolmogorov, Vladimir
Publié: (2023)

On the cut-query complexity of approximating max-cut
par: Plevrakis, Orestis, et autres
Publié: (2022)

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

Path Cover, Hamiltonicity, and Independence Number: An FPT Perspective
par: Fomin, Fedor V., et autres
Publié: (2024)

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

Minimum $s$--$t$ Cuts with Fewer Cut Queries
par: Jiang, Yonggang, et autres
Publié: (2025)

(Almost-)Optimal FPT Algorithm and Kernel for $T$-Cycle on Planar Graphs
par: Gahlawat, Harmender, et autres
Publié: (2025)

Constrained Level Planarity is FPT with Respect to the Vertex Cover Number
par: Klemz, Boris, et autres
Publié: (2024)

Simpler O(1) Query Algorithm for Level Ancestors
par: Saxena, Sanjeev
Publié: (2022)