1: A Novel Mathematical Model for the Unique Shortest Path Routing Problem
2: Range Medians
3: Greedy D-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
4: Shortest Paths Avoiding Forbidden Subpaths
5: Bloomier Filters: A second look