Dipòsit Digital de Documents de la UAB
metadata only
A capacity scaling algorithm for convex cost submodular flows
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
- Approximate Pareto Frontiers for Submodular Utility and Cost Tradeoffs#987592
- XOR Bidding and Knapsack Formulations for HPC Network Resource Allocation#246482
- A proximal subgradient algorithm for constrained multiobjective DC-type optimization#925885
- An analytical solution for network models with heterogeneous and interacting agents#247012
- Official Review · ICLR 2025#787190
Record · ID 429975
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