arXiv (All)
open access
Large-Scale Network Utility Maximization via GPU-Accelerated Proximal Message Passing
We present a GPU-accelerated proximal message passing algorithm for large-scale network utility maximization (NUM). NUM is a fundamental problem in resource allocation, where resources are allocated across various streams in a network to maximize total utility while respecting link capacity constrai
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
- Streaming Hypergraph Coloring via Palette Sparsification#1013660
- Clear-Weighted Bit Allocation for Satellite Downlinks#423900
- Submodular Welfare under Routing Coupling: A Hierarchical Decomposition with Perturbation Guarantees#984665
- Maximum Strong Independent Sets in Hypergraphs: Reductions, Bounds, and Greedy Certificates#1011663
- Deterministic Streaming Lower Bounds for Approximate Maximum Clique and Maximum Independent Set#1012810
Record · ID 998015
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