Federal Project Grant Award Summary

The National Science Foundation's Division of Computing and Communication Foundations awarded a CAREER grant totaling $591,687 to Brown University on June 1, 2026, to develop foundational theory and algorithms for length-constrained graph problems. The project, which extends through May 31, 2031, aims to advance graph algorithm design by establishing new methodologies that incorporate length constraints—a mechanism for optimizing communication speed in networks. The research will leverage graph cuts and metric embeddings theories to develop close-to-linear-time algorithms for classical flow problems, including minimum cost multi-commodity flow and directed Steiner tree applications. The work will specifically focus on length-constrained expander decompositions and flow emulators to achieve algorithmic efficiency improvements.

Deliverables under this Computer and Information Science and Engineering (CFDA 47.070) award will be disseminated broadly through peer-reviewed publications, research tutorials, survey papers, and new graduate-level courses made publicly available. No subawards are planned for this grant. The research outcomes will contribute foundational knowledge to the field of graph algorithms, addressing gaps in classic algorithmic approaches that fail under length-constraint conditions and providing practical solutions for network design and optimization problems.