No. Title Author Year
1 Non-Clairvoyant Precedence Constrained Scheduling Garg, Naveen et al. 2019
2 Stochastic Online Metric Matching Gupta, Anupam et al. 2019
3 Tight FPT Approximations for k-Median and k-Means Cohen-Addad, Vincent et al. 2019
4 A Local-Search Algorithm for Steiner Forest Groß, Martin et al. 2018
5 Fully-Dynamic Bin Packing with Little Repacking Feldkord, Björn et al. 2018
6 Maximizing Profit with Convex Costs in the Random-order Model Gupta, Anupam et al. 2018
7 Non-Preemptive Flow-Time Minimization via Rejections Gupta, Anupam et al. 2018
8 Stochastic Unsplittable Flows Gupta, Anupam et al. 2017
9 Approximation Algorithms for Aversion k-Clustering via Local k-Median Gupta, Anupam et al. 2016
10 A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs Bansal, Nikhil et al. 2015
Current Page :
Number of result pages: 2
Number of documents: 13


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI