The following pages link to Ashkan Norouzi-Fard (Q487030):
Displaying 10 items.
- The minimum vulnerability problem (Q487032) (← links)
- Towards Tight Lower Bounds for Scheduling Problems (Q3452775) (← links)
- The Minimum Vulnerability Problem (Q4909555) (← links)
- Dynamic Facility Location via Exponential Clocks (Q4962653) (← links)
- Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms (Q5117377) (← links)
- The one-way communication complexity of submodular maximization with applications to streaming and robustness (Q5145019) (← links)
- Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples (Q5146888) (← links)
- Data-Driven Rebalancing Methods for Bike-Share Systems (Q5154459) (← links)
- Dynamic Facility Location via Exponential Clocks (Q5362989) (← links)
- Streaming submodular maximization under matroid constraints (Q6560853) (← links)
