Image de couverture de livre

Improved FPT Approximation Scheme and Approximate Kernel for Biclique-Free Max k-Weight SAT: Greedy Strikes Back

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Manurangsi, Pasin
Format:	Preprint
Publié:	2024
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

Improved Approximation Algorithm for Maximum Balanced Biclique
par: Manurangsi, Pasin
Publié: (2026)

A Note on Approximability of Densest At-Least-k-Subgraph
par: Laekhanukit, Bundit, et autres
Publié: (2026)

The Price of Privacy For Approximating Max-CSP
par: Dharangutte, Prathamesh, et autres
Publié: (2026)

On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP
par: S., Karthik C., et autres
Publié: (2024)

An Improved Greedy Approximation for (Metric) $k$-Means
par: Charikar, Moses, et autres
Publié: (2026)

Improved Lower Bound for Differentially Private Facility Location
par: Manurangsi, Pasin
Publié: (2024)

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

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

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

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

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

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

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

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

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

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

On the Efficient Discovery of Maximum $k$-Defective Biclique
par: Cui, Donghang, et autres
Publié: (2025)

Infinitely Divisible Noise for Differential Privacy: Nearly Optimal Error in the High $\varepsilon$ Regime
par: Harrison, Charlie, et autres
Publié: (2025)

Exact zCDP Characterizations for Fundamental Differentially Private Mechanisms
par: Harrison, Charlie, et autres
Publié: (2025)

Nearly-Optimal Private Selection via Gaussian Mechanism
par: Leeman, Ethan, et autres
Publié: (2025)

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

Laminar Matroid Secretary: Greedy Strikes Back
par: Huang, Zhiyi, et autres
Publié: (2023)

Fine Grained Lower Bounds for Multidimensional Knapsack
par: Doron-Arad, Ilan, et autres
Publié: (2024)

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

Improved Differentially Private Algorithms for Rank Aggregation
par: Hillebrand, Quentin, et autres
Publié: (2025)

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

Improved Combinatorial Approximations for Weighted Correlation Clustering
par: Ostovari, Mojtaba, et autres
Publié: (2023)

A Simpler Exponential-Time Approximation Algorithm for MAX-k-SAT
par: Buhrman, Harry, et autres
Publié: (2025)

Structural Parameterizations of the Biclique-Free Vertex Deletion Problem
par: Goldmann, Lito, et autres
Publié: (2023)

Faster Approximation Scheme for Euclidean $k$-TSP
par: van Wijland, Ernest, et autres
Publié: (2023)

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

An Improved Approximation Algorithm for Maximum Weight 3-Path Packing
par: Zhao, Jingyang, et autres
Publié: (2025)

Improved Approximation Algorithms for Chromatic and Pseudometric-Weighted Correlation Clustering
par: Fan, Chenglin, et autres
Publié: (2025)

Biclique Reconfiguration in Bipartite Graphs
par: Otachi, Yota, et autres
Publié: (2026)

Faster Weak Expander Decompositions and Approximate Max Flow
par: Fleischmann, Henry, et autres
Publié: (2025)

Improved Approximation Algorithms for Multiway Cut by Large Mixtures of New and Old Rounding Schemes
par: Brakensiek, Joshua, et autres
Publié: (2026)

Additive Approximation Schemes for Low-Dimensional Embeddings
par: Anderson, Prashanti, et autres
Publié: (2025)

Approximation Schemes for Planar Graph Connectivity Problems
par: Neuwohner, Meike, et autres
Publié: (2025)

Dimension-Free Parameterized Approximation Schemes for Hybrid Clustering
par: Gadekar, Ameet, et autres
Publié: (2025)

Min-CSPs on Complete Instances II: Polylogarithmic Approximation for Min-NAE-3-SAT
par: Anand, Aditya, et autres
Publié: (2025)