arXiv (All)
open access
On the Approximation Relationship between Optimizing Ratio of Submodular (RS) and Difference of Submodular (DS) Functions
We demonstrate that from an algorithm guaranteeing an approximation factor for the ratio of submodular (RS) optimization problem, we can build another algorithm having a different kind of approximation guarantee -- weaker than the classical one -- for the difference of submodular (DS) optimization p
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
- Online Submodular Welfare Maximization: Computation is not the Bottleneck#1327650
- How to Make the Gradient Mapping Small for Constrained Stochastic Min-Max Problems and Beyond#985736
- Hybrid Algorithms for Two-Level Learning and Optimization: Theory and Applications#445366
- Real-weighted diameter and eccentricities of minor-free and bounded VC-dimension graphs in truly subquadratic time#1146753
- Curvature-Distortion Numbers of Graphs: Prescribed Lin--Lu--Yau Curvature Lower Bounds#1356790
Record · ID 1199587
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