:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Gupta, Anupam, Lee, Euiwoong, Li, Jason, Mucha, Marcin, Newman, Heather, Sarkar, Sherry
Format:	Preprint
Publié:	2021
Sujets:	Data Structures and Algorithms
Accès en ligne:	https://arxiv.org/abs/2111.09290
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Dual Charging for Half-Integral TSP
par: Klein, Nathan, et autres
Publié: (2025)

Improved Algorithms for Fair Matroid Submodular Maximization
par: Mahabadi, Sepideh, et autres
Publié: (2026)

Asymptotically Optimal Hardness for $k$-Set Packing and $k$-Matroid Intersection
par: Lee, Euiwoong, et autres
Publié: (2024)

Max Cut with Small-Dimensional SDP Solutions
par: Chang, Hsien-Chih, et autres
Publié: (2026)

All-Subsets Important Separators with Applications to Sample Sets, Balanced Separators and Vertex Sparsifiers in Directed Graphs
par: Anand, Aditya, et autres
Publié: (2025)

Approximating Small Sparse Cuts
par: Anand, Aditya, et autres
Publié: (2024)

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

Complexity of Local Search for CSPs Parameterized by Constraint Difference
par: Anand, Aditya, et autres
Publié: (2025)

Facility Location on High-dimensional Euclidean Spaces
par: Lee, Euiwoong, et autres
Publié: (2025)

Separating $k$-Median from the Supplier Version
par: Anand, Aditya, et autres
Publié: (2024)

Understanding the Cluster LP for Correlation Clustering
par: Cao, Nairen, et autres
Publié: (2024)

Unbreakable Decomposition in Close-to-Linear Time
par: Anand, Aditya, et autres
Publié: (2024)

1.64-Approximation for Chromatic Correlation Clustering via Chromatic Cluster LP
par: Lee, Dahoon, et autres
Publié: (2025)

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

Max-Cut with $ε$-Accurate Predictions
par: Cohen-Addad, Vincent, et autres
Publié: (2024)

An $\widetilde{O} (n^{3/7})$ Round Parallel Algorithm for Matroid Bases
par: Khanna, Sanjeev, et autres
Publié: (2026)

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

Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to k-Median
par: Cohen-Addad, Vincent, et autres
Publié: (2022)

Combinatorial Optimization using Comparison Oracles
par: Cohen-Addad, Vincent, et autres
Publié: (2025)

Online Metric TSP
par: Bertram, Christian
Publié: (2025)

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

The Online Submodular Cover Problem
par: Gupta, Anupam, et autres
Publié: (2025)

Steiner Forest: A Simplified Better-Than-2 Approximation
par: Gupta, Anupam, et autres
Publié: (2025)

Fully-Dynamic Submodular Cover with Bounded Recourse
par: Gupta, Anupam, et autres
Publié: (2020)

Dynamic Matroids: Base Packing and Covering
par: de Vos, Tijn, et autres
Publié: (2025)

Sample-Based Matroid Prophet Inequalities
par: Fu, Hu, et autres
Publié: (2024)

On the Approximability of Max-Cut on 3-Colorable Graphs and Graphs with Large Independent Sets
par: Ghoshal, Suprovat, et autres
Publié: (2026)

Solving the Correlation Cluster LP in Sublinear Time
par: Cao, Nairen, et autres
Publié: (2025)

Static to Dynamic Correlation Clustering
par: Cao, Nairen, et autres
Publié: (2025)

Efficiently Coloring the Intersection of a General Matroid and Partition Matroids
par: Arndt, Stephen, et autres
Publié: (2025)

A $(2+\varepsilon)$-Approximation Algorithm for Metric $k$-Median
par: Cohen-Addad, Vincent, et autres
Publié: (2025)

Online Steiner Forest with Recourse
par: Long, Yaowei, et autres
Publié: (2026)

Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order
par: Buchbinder, Niv, et autres
Publié: (2026)

Approximating Matroid Basis Testing for Partition Matroids using Budget-In-Expectation
par: Hellerstein, Lisa, et autres
Publié: (2026)

Approximating Prize-Collecting Variants of TSP
par: Alimi, Morteza, et autres
Publié: (2024)

4/3-Approximation of Graphic TSP
par: Çivril, Ali
Publié: (2023)

Improved Approximation Algorithms for (1,2)-TSP and Max-TSP Using Path Covers in the Semi-Streaming Model
par: Alipour, Sharareh, et autres
Publié: (2025)

Sum-Of-Squares To Approximate Knapsack
par: Kothari, Pravesh K., et autres
Publié: (2025)

Clustering with Non-adaptive Subset Queries
par: Black, Hadley, et autres
Publié: (2024)

Submodular Maximization Subject to Uniform and Partition Matroids: From Theory to Practical Applications and Distributed Solutions
par: Kia, Solmaz S.
Publié: (2025)