No. Title Author Year
1 A Local-Search Algorithm for Steiner Forest Groß, Martin et al. 2018
2 Fully-Dynamic Bin Packing with Little Repacking Feldkord, Björn et al. 2018
3 Maximizing Profit with Convex Costs in the Random-order Model Gupta, Anupam et al. 2018
4 Non-Preemptive Flow-Time Minimization via Rejections Gupta, Anupam et al. 2018
5 Stochastic Unsplittable Flows Gupta, Anupam et al. 2017
6 Approximation Algorithms for Aversion k-Clustering via Local k-Median Gupta, Anupam et al. 2016
7 A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs Bansal, Nikhil et al. 2015
8 10211 Abstracts Collection -- Flexible Network Design Gupta, Anupam et al. 2010
9 Differentially Private Combinatorial Optimization Talwar, Kunal et al. 2010
10 All-Norms and All-L_p-Norms Approximation Algorithms Golovin, Daniel et al. 2008
Current Page :
Number of result pages: 1
Number of documents: 10


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