arXiv (All)
open access
An Approximation Algorithm for Monotone Submodular Cost Allocation
In this paper, we consider the minimum submodular cost allocation (MSCA) problem. The input of MSCA consists of $k$ nonnegative submodular functions $f_1,f_2,\ldots,f_k$ on the ground set $N$ given by evaluation oracles, and the goal is to partition $N$ into $k$ (possibly empty) sets $S_1,S_2,\ldots
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 $(1+1/\sqrt{2})$-Approximation for the Multiple-Depot Traveling Salesman Problem#1014130
- Pre-Synthesis Optimization of Arithmetic Circuits#1100147
- Combinatorial Optimization#66996
- Sum Rate Maximization for the Constant Envelope MIMO Downlink / Ferhad Askerbeyli ; Gutachter: Josef A. Nossek, Amine Mezghani, Klaus Diepold ; Betreuer: Josef A. Nossek#1145484
- Disjunctive Submodular Functions: Envelopes and Applications to Inventory and 0-1 Quadratic Optimization#1105271
Record · ID 1012077
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