Image de couverture de livre

Min-Sum Set Cover on Parallel Machines

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Szyfelbein, Michał
Format:	Preprint
Publié:	2026
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

Precedence-Constrained Decision Trees and Coverings
par: Szyfelbein, Michał, et autres
Publié: (2026)

Average Case Graph Searching in Non-Uniform Cost Models
par: Szyfelbein, Michał
Publié: (2026)

Polylogarithmic Approximation for Covering and Connecting Multi-Interface Networks
par: Szyfelbein, Michał, et autres
Publié: (2026)

Approximating the Average-Case Graph Search Problem with Non-Uniform Costs
par: Szyfelbein, Michał
Publié: (2025)

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

Constant-Factor Approximation for the Uniform Decision Tree
par: Szyfelbein, Michał
Publié: (2026)

Searching in trees with $k$-up-modular cost functions
par: Szyfelbein, Michał
Publié: (2025)

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

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

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

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

Minimum Sum Set Cover: Structures and Algorithm
par: Zhang, Zhongyi, et autres
Publié: (2026)

Improved fixed-parameter bounds for Min-Sum-Radii and Diameters $k$-clustering and their fair variants
par: Banerjee, Sandip, et autres
Publié: (2025)

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

Parameterized Algorithms for Minimum Sum Vertex Cover
par: Aute, Shubhada, et autres
Publié: (2024)

Pareto Sums of Pareto Sets: Lower Bounds and Algorithms
par: Funke, Daniel, et autres
Publié: (2024)

Approximation Ratio of the Min-Degree Greedy Algorithm for Maximum Independent Set on Interval and Chordal Graphs
par: Chaplick, Steven, et autres
Publié: (2024)

Fair Set Cover
par: Dehghankar, Mohsen, et autres
Publié: (2024)

Parameterized Max Min Feedback Vertex Set
par: Lampis, Michael, et autres
Publié: (2023)

Improved Dominance Filtering for Unions and Minkowski Sums of Pareto Sets
par: Karathanasis, Konstantinos, et autres
Publié: (2025)

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

Sum-of-Squares Lower Bounds for Independent Set in Ultra-Sparse Random Graphs
par: Kothari, Pravesh, et autres
Publié: (2024)

Solution Discovery for Vertex Cover, Independent Set, Dominating Set, and Feedback Vertex Set
par: Saito, Rin, et autres
Publié: (2025)

Does Subset Sum Admit Short Proofs?
par: Włodarczyk, Michał
Publié: (2024)

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

Engineering Algorithms for Dynamic Greedy Set Cover
par: Uzrad, Amitai
Publié: (2026)

Dynamic Set Cover with Worst-Case Recourse
par: Solomon, Shay, et autres
Publié: (2025)

Dynamic Pricing Algorithms for Online Set Cover
par: Bender, Max, et autres
Publié: (2024)

Online Disjoint Set Covers: Randomization is not Necessary
par: Bienkowski, Marcin, et autres
Publié: (2024)

Random Order Set Cover is as Easy as Offline
par: Gupta, Anupam, et autres
Publié: (2021)

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

A Lossless Deamortization for Dynamic Greedy Set Cover
par: Solomon, Shay, et autres
Publié: (2024)

Enumeration kernels for Vertex Cover and Feedback Vertex Set
par: Bougeret, Marin, et autres
Publié: (2025)

Online Rounding for Set Cover under Subset Arrivals
par: Byrka, Jarosław, et autres
Publié: (2025)

Structural Parameterization of Locating-Dominating Set and Test Cover
par: Chakraborty, Dipayan, et autres
Publié: (2024)

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

Dynamic $((1+ε)\ln n)$-Approximation Algorithms for Minimum Set Cover and Dominating Set
par: Solomon, Shay, et autres
Publié: (2023)

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

GIST: Greedy Independent Set Thresholding for Max-Min Diversification with Submodular Utility
par: Fahrbach, Matthew, et autres
Publié: (2024)

Faster Minimization of Total Weighted Completion Time on Parallel Machines
par: Hermelin, Danny, et autres
Publié: (2025)