Submodularity Property for Facility Locations of Dynamic Flow Networks
Using Light Spanning Graphs for Passenger Assignment in Public Transport
Non-Pool-Based Line Planning on Graphs of Bounded Treewidth
A Faster Algorithm for Recognizing Directed Graphs Invulnerable to Braess’s Paradox