| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Minimizing the Maximum Flow Time in the Online Food Delivery Problem | Guo, Xiangyu et al. | 2022 |
| 2 | Nested Active-Time Scheduling | Cao, Nairen et al. | 2022 |
| 3 | Impatient PPSZ - A Faster Algorithm for CSP | Li, Shibo et al. | 2021 |
| 4 | On Approximating Degree-Bounded Network Design Problems | Guo, Xiangyu et al. | 2020 |
| 5 | On the Facility Location Problem in Online and Dynamic Models | Guo, Xiangyu et al. | 2020 |
| 6 | Flow-time Optimization for Concurrent Open-Shop and Precedence Constrained Scheduling Models | Kulkarni, Janardhan et al. | 2018 |
| 7 | Constant Approximation for Capacitated k-Median with (1+epsilon)-Capacity Violation | Demirci, Gökalp et al. | 2016 |
| 8 | Dispersing Points on Intervals | Li, Shimin et al. | 2016 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 8 |