Paper (working draft): Graph-Signal-Processing foundations for cycling-network expansion. Spectral bounds, optimal siting (D-optimal greedy, MCLP, k-median), empirical learning curves on dock-based bike-share systems.
bike-sharing cycling laplacian submodular-optimization graph-signal-processing sampling-theory mclp d-optimal station-siting spectral-bounds
-
Updated
May 21, 2026 - Python