Image de couverture de livre

Optimal 4-Approximation for the Correlated Pandora's Problem

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bansal, Nikhil, Huang, Zhiyi, Zhu, Zixuan
Format:	Preprint
Publié:	2025
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

On Approximating Cutwidth and Pathwidth
par: Bansal, Nikhil, et autres
Publié: (2023)

Expander Decomposition with Almost Optimal Overhead
par: Bansal, Nikhil, et autres
Publié: (2026)

Improved SDP-Based Algorithm for Coloring 3-Colorable Graphs
par: Bansal, Nikhil, et autres
Publié: (2026)

Pandora with Inaccurate Priors
par: Banihashem, Kiarash, et autres
Publié: (2025)

Sensitivity Sampling for $k$-Means: Worst Case and Stability Optimal Coreset Bounds
par: Bansal, Nikhil, et autres
Publié: (2024)

Optimal Stopping with a Predicted Prior
par: Bai, Tian, et autres
Publié: (2025)

Optimal Approximations for the Requirement Cut Problem on Sparse Graph Classes
par: Mallek, Nadym, et autres
Publié: (2025)

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

Pandora's Problem with Combinatorial Cost
par: Berger, Ben, et autres
Publié: (2023)

Warehouse Problem with Multiple Vendors and Generalized Complementarity Constraints
par: Bansal, Ishan, et autres
Publié: (2024)

Robust Max Selection
par: Dang, Trung, et autres
Publié: (2024)

Hardness and Approximation Algorithms for Balanced Districting Problems
par: Dharangutte, Prathamesh, et autres
Publié: (2025)

Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions
par: Bansal, Ishan, et autres
Publié: (2022)

An Approximate Generalization of the Okamura-Seymour Theorem
par: Kumar, Nikhil
Publié: (2022)

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

An Improved Bound for the Beck-Fiala Conjecture
par: Bansal, Nikhil, et autres
Publié: (2025)

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

A $\frac{4}{3}$-Approximation for the Maximum Leaf Spanning Arborescence Problem in DAGs
par: Neuwohner, Meike
Publié: (2024)

Pandora's Box Problem With Time Constraints
par: Amanatidis, Georgios, et autres
Publié: (2024)

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

New Approximation Guarantees for The Inventory Staggering Problem
par: Alon, Noga, et autres
Publié: (2025)

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

Improved Approximations for Dial-a-Ride Problems
par: Zhao, Jingyang, et autres
Publié: (2026)

On the Approximability of the Traveling Salesman Problem with Line Neighborhoods
par: Antoniadis, Antonios, et autres
Publié: (2020)

3/2-Approximation for the Forest Augmentation Problem
par: Çivril, Ali
Publié: (2024)

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

Simultaneously Approximating All Norms for Massively Parallel Correlation Clustering
par: Cao, Nairen, et autres
Publié: (2024)

Online Matching: A Brief Survey
par: Huang, Zhiyi, et autres
Publié: (2024)

Stochastic Online Correlated Selection
par: Chen, Ziyun, et autres
Publié: (2024)

Optimal Approximate Matrix Multiplication over Sliding Window
par: Xian, Haoming, et autres
Publié: (2025)

Constant Approximation of Arboricity in Near-Optimal Sublinear Time
par: Dai, Jiangqi, et autres
Publié: (2025)

An Improved Approximation Algorithm for the Capacitated Arc Routing Problem
par: Zhao, Jingyang, et autres
Publié: (2025)

Exponential-Time Approximation (Schemes) for Vertex-Ordering Problems
par: Bentert, Matthias, et autres
Publié: (2025)

Complexity and Approximation Algorithms for Fixed Charge Transportation Problems
par: Chen, Yong, et autres
Publié: (2025)

Enhanced Approximation Algorithms for the Capacitated Location Routing Problem
par: Zhao, Jingyang, et autres
Publié: (2025)

Improved Approximations for the Unsplittable Capacitated Vehicle Routing Problem
par: Zhao, Jingyang, et autres
Publié: (2026)

A Global Analysis of the Primal-Dual Method for Pliable Families
par: Bansal, Ishan
Publié: (2023)

Tighter Bounds on Non-clairvoyant Parallel Machine Scheduling with Prediction to Minimize Makespan
par: Chen, Tianqi, et autres
Publié: (2025)

Additive Spanner Lower Bounds with Optimal Inner Graph Structure
par: Bodwin, Greg, et autres
Publié: (2024)

Edge-weighted Matching in the Dark
par: Huang, Zhiyi, et autres
Publié: (2025)