No. Title Author Year
1 Non-Clairvoyant Precedence Constrained Scheduling Garg, Naveen et al. 2019
2 Tight FPT Approximations for k-Median and k-Means Cohen-Addad, Vincent et al. 2019
3 A Local-Search Algorithm for Steiner Forest Groß, Martin et al. 2018
4 Approximate Clustering with Same-Cluster Queries Ailon, Nir et al. 2018
5 Approximating Airports and Railways Adamaszek, Anna et al. 2018
6 Fully-Dynamic Bin Packing with Little Repacking Feldkord, Björn et al. 2018
7 Non-Preemptive Flow-Time Minimization via Rejections Gupta, Anupam et al. 2018
8 Faster Algorithms for the Constrained k-Means Problem Bhattacharya, Anup et al. 2016
9 Minimizing Weighted lp-Norm of Flow-Time in the Rejection Model Roy Choudhury, Anamitra et al. 2015
10 LIPIcs, Volume 13, FSTTCS'11, Complete Volume Chakraborthy, Supratik et al. 2013
Current Page :
Number of result pages: 2
Number of documents: 15


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