| No. | Title | Author | Year |
|---|---|---|---|
| 1 | An Algorithmic Approach to Address Course Enrollment Challenges | Biswas, Arpita et al. | 2023 |
| 2 | Scalable Auction Algorithms for Bipartite Maximum Matching Problems | Liu, Quanquan C. et al. | 2023 |
| 3 | Correlated Stochastic Knapsack with a Submodular Objective | Yang, Sheng et al. | 2022 |
| 4 | On the Cost of Essentially Fair Clusterings | Bercea, Ioana O. et al. | 2019 |
| 5 | Constant Factor Approximation Algorithm for Uniform Hard Capacitated Knapsack Median Problem | Grover, Sapna et al. | 2018 |
| 6 | Revisiting Connected Dominating Sets: An Optimal Local Algorithm? | Khuller, Samir et al. | 2016 |
| 7 | Scheduling Distributed Clusters of Parallel Machines: Primal-Dual and LP-based Approximation Algorithms | Murray, Riley et al. | 2016 |
| 8 | On Correcting Inputs: Inverse Optimization for Online Structured Prediction | Daumé III, Hal et al. | 2015 |
| 9 | Energy Efficient Scheduling via Partial Shutdown | Khuller, Samir et al. | 2010 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 9 |