arXiv (All)
open access
Min-Sum Set Cover on Parallel Machines
We consider a generalization of the Min-Sum Set Cover to the setup with $m$ set-sequences, or in scheduling terminology, $m$ parallel machines. We call this problem Parallel Min-Sum Set Cover. To obtain approximation algorithms for its numerous variants we use a crucial sub-problem called Parallel D
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A deterministic $(2 + \varepsilon)$-approximation for directed feedback vertex sets in tournaments#1122732
- On Alon's problem concerning the difference between connected domination number and domination number#1077551
- Approximating Minimum Dominating Set with Few Awake Rounds#467098
- Selecting k Paths with the Minimum Longest Path Length in the Stochastic Semi-Bandit Setting#1084502
- A disproof of a gap-one conjecture for the equitable chromatic number of block graphs#609675
Record · ID 1141517
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive