:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Anand, Aditya, Lee, Euiwoong, Mazzali, Davide, Sharma, Amatya
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms
Accès en ligne:	https://arxiv.org/abs/2504.19051
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Min-CSPs on Complete Instances
par: Anand, Aditya, et autres
Publié: (2024)

Characterizing Streaming Decidability of CSPs via Non-Redundancy
par: Sharma, Amatya, et autres
Publié: (2026)

Non-Redundancy of Low-Arity Symmetric Boolean CSPs
par: Sharma, Amatya, et autres
Publié: (2026)

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

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

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

On Approximability of $\ell_2^2$ Min-Sum Clustering
par: S., Karthik C., et autres
Publié: (2024)

On the Mysteries of MAX NAE-SAT
par: Brakensiek, Joshua, et autres
Publié: (2020)

Search-space Reduction for Boolean MinCSPs via Essential Constraints
par: Jansen, Bart M. P., et autres
Publié: (2026)

Approximate Min-Sum Subset Convolution
par: Stoian, Mihail
Publié: (2024)

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

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

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

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

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

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

Polylogarithmic Approximation for Robust s-t Path
par: Li, Shi, et autres
Publié: (2023)

A 4.509-Approximation Algorithm for Generalized Min Sum Set Cover
par: Bhangale, Amey, et autres
Publié: (2026)

Faster Min-Cost Flow and Approximate Tree Decomposition on Bounded Treewidth Graphs
par: Dong, Sally, et autres
Publié: (2023)

Max-Min Diversification with Asymmetric Distances
par: Kumpulainen, Iiro, et autres
Publié: (2025)

Fair-Count-Min: Frequency Estimation under Equal Group-wise Approximation Factor
par: Shahbazi, Nima, et autres
Publié: (2025)

On the Approximability of Train Routing and the Min-Max Disjoint Paths Problem
par: Bhaskar, Umang, et autres
Publié: (2025)

Approximating Fair $k$-Min-Sum-Radii in Euclidean Space
par: Drexler, Lukas, et autres
Publié: (2023)

Min-Sum Set Cover on Parallel Machines
par: Szyfelbein, Michał
Publié: (2026)

Deterministic Monotone Min-Plus Product and Convolution
par: Jin, Ce, et autres
Publié: (2026)

Approximation Ratio of the Min-Degree Greedy Algorithm for Maximum Independent Set on Interval and Chordal Graphs
par: Chaplick, Steven, 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)

Submodular Max-Min Allocation under Identical Valuations
par: Boehmer, Kimon
Publié: (2026)

Parameterized Complexity of MinCSP over the Point Algebra
par: Osipov, George, et autres
Publié: (2023)

Approximation algorithms for satisfiable and nearly satisfiable ordering CSPs
par: Makarychev, Yury
Publié: (2026)

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

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

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

On the Parameterized Complexity of Min-Sum-Radii
par: Kumar, Pankaj, et autres
Publié: (2026)

Min-1-Planarity is NP-Hard
par: Okada, Yuto
Publié: (2026)

Improved Bounds for Rectangular Monotone Min-Plus Product and Applications
par: Dürr, Anita
Publié: (2022)

Robust Multiagent Collaboration Through Weighted Max-Min T-Joins
par: Alipour, Sharareh
Publié: (2026)

Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial Time
par: Jin, Wenyu, et autres
Publié: (2024)

An Improved Algorithm for Sparse Instances of SAT
par: Jain, Sanjay, et autres
Publié: (2024)

A Polylogarithmic Approximation for Directed Steiner Forest in Planar Digraphs
par: Chekuri, Chandra, et autres
Publié: (2024)