Imagen de Portada

Improved Approximation Algorithm for Maximum Balanced Biclique

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Manurangsi, Pasin
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Improved Lower Bound for Differentially Private Facility Location
por: Manurangsi, Pasin
Publicado: (2024)

Improved Differentially Private Algorithms for Rank Aggregation
por: Hillebrand, Quentin, et al.
Publicado: (2025)

A Note on Approximability of Densest At-Least-k-Subgraph
por: Laekhanukit, Bundit, et al.
Publicado: (2026)

On the Efficient Discovery of Maximum $k$-Defective Biclique
por: Cui, Donghang, et al.
Publicado: (2025)

Infinitely Divisible Noise for Differential Privacy: Nearly Optimal Error in the High $\varepsilon$ Regime
por: Harrison, Charlie, et al.
Publicado: (2025)

Exact zCDP Characterizations for Fundamental Differentially Private Mechanisms
por: Harrison, Charlie, et al.
Publicado: (2025)

Nearly-Optimal Private Selection via Gaussian Mechanism
por: Leeman, Ethan, et al.
Publicado: (2025)

Fine Grained Lower Bounds for Multidimensional Knapsack
por: Doron-Arad, Ilan, et al.
Publicado: (2024)

Algorithmic Persuasion with Evidence
por: Hoefer, Martin, et al.
Publicado: (2020)

Keeping a Secret Requires a Good Memory: Space Lower-Bounds for Private Algorithms
por: Epasto, Alessandro, et al.
Publicado: (2026)

On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP
por: S., Karthik C., et al.
Publicado: (2024)

The Price of Privacy For Approximating Max-CSP
por: Dharangutte, Prathamesh, et al.
Publicado: (2026)

An Improved Approximation Algorithm for Maximum Weight 3-Path Packing
por: Zhao, Jingyang, et al.
Publicado: (2025)

Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction
por: Krithika, R., et al.
Publicado: (2023)

Biclique Reconfiguration in Bipartite Graphs
por: Otachi, Yota, et al.
Publicado: (2026)

Convex Optimization with Local Label Differential Privacy: Tight Bounds in All Privacy Regimes
por: Chua, Lynn, et al.
Publicado: (2026)

Structural Parameterizations of the Biclique-Free Vertex Deletion Problem
por: Goldmann, Lito, et al.
Publicado: (2023)

Hardness and Approximation Algorithms for Balanced Districting Problems
por: Dharangutte, Prathamesh, et al.
Publicado: (2025)

Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching
por: Zheng, Da Wei, et al.
Publicado: (2023)

Engineering Insights into Biclique Partitions and Fractional Binary Ranks of Matrices
por: Ghosal, Angikar, et al.
Publicado: (2025)

Individualized Privacy Accounting via Subsampling with Applications in Combinatorial Optimization
por: Ghazi, Badih, et al.
Publicado: (2024)

On Inapproximability of Reconfiguration Problems: PSPACE-Hardness and some Tight NP-Hardness Results
por: Guruswami, Venkatesan, et al.
Publicado: (2023)

On Computing Pairwise Statistics with Local Differential Privacy
por: Ghazi, Badih, et al.
Publicado: (2024)

Improved Additive Approximation Algorithms for APSP
por: Jin, Ce, et al.
Publicado: (2025)

Fast Biclique Counting on Bipartite Graphs: A Node Pivot-based Approach
por: Ye, Xiaowei, et al.
Publicado: (2024)

Maximum Biclique for Star 1,2,3 -free and Bounded Bimodularwidth Twin-free Bipartite Graphs $\star$
por: de Montgolfier, Fabien, et al.
Publicado: (2025)

Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy
por: Wang, Kaixin, et al.
Publicado: (2026)

Linear-Time User-Level DP-SCO via Robust Statistics
por: Ghazi, Badih, et al.
Publicado: (2025)

Improved Approximation Algorithms for Three-Dimensional Knapsack
por: Jansen, Klaus, et al.
Publicado: (2025)

An Improved Approximation Algorithm for Metric Triangle Packing
por: Zhao, Jingyang, et al.
Publicado: (2024)

Privacy Filters are Captured by Residues: A Characterization of Free Natural Filters and the Cost of Adaptivity
por: Regehr, Matthew, et al.
Publicado: (2026)

Private Hyperparameter Tuning with Ex-Post Guarantee
por: Ghazi, Badih, et al.
Publicado: (2025)

Approximation Ratio of the Min-Degree Greedy Algorithm for Maximum Independent Set on Interval and Chordal Graphs
por: Chaplick, Steven, et al.
Publicado: (2024)

A Simple 4-Approximation Algorithm for Maximum Agreement Forests on Multiple Unrooted Binary Trees
por: Dempsey, Jordan, et al.
Publicado: (2024)

A Fast Approximation Algorithm for the Minimum Balanced Vertex Separator in a Graph
por: Kolmogorov, Vladimir, et al.
Publicado: (2026)

Improved Approximation Algorithms for Non-Preemptive Throughput Maximization
por: Armbruster, Alexander, et al.
Publicado: (2026)

An Improved Approximation Algorithm for the Capacitated Arc Routing Problem
por: Zhao, Jingyang, et al.
Publicado: (2025)

FPT Approximations for Connected Maximum Coverage
por: Inamdar, Tanmay, et al.
Publicado: (2026)

Maximum Unique Coverage on Streams: Improved FPT Approximation Scheme and Tighter Space Lower Bound
por: Cervenjak, Philip, et al.
Publicado: (2024)