arxiv
PublishedJuly 16, 2026 at 4:00 AM
—neutral
Graph Partitioning with Demands: Generalized Conductance and its Applications
Publisher summary· verbatim
arXiv:2607.13218v1 Announce Type: cross Abstract: In this work, we study various graph partitioning problems under a general demand model. In each such task, we are given a graph $G=(V,E,c,w)$ with a capacity function $c\colon E\to \mathbb{N}$ and a demand function $w\colon V\times V\to \mathbb{N}$.
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivCapacity and Redundancy Trade-offs in Multi-Task Learning13harxivPredictive Training with Latent Imagination for Visual Quadruped Navigation13harxivWhere Not to Learn: Prior-Aligned Training with Subset-based Attribution Constraints for Reliable Decision-Making13harxivDid We Actually Fix It? An Independent Adversarial Stress-Test of Post-Point-Adjustment Evaluation Metrics for Time-Series Anomaly Detection13hThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗