No. Title Author Year
1 A Local-Search Algorithm for Steiner Forest Groß, Martin et al. 2018
2 Approximate Clustering with Same-Cluster Queries Ailon, Nir et al. 2018
3 Approximating Airports and Railways Adamaszek, Anna et al. 2018
4 Fully-Dynamic Bin Packing with Little Repacking Feldkord, Björn et al. 2018
5 Non-Preemptive Flow-Time Minimization via Rejections Gupta, Anupam et al. 2018
6 Faster Algorithms for the Constrained k-Means Problem Bhattacharya, Anup et al. 2016
7 Minimizing Weighted lp-Norm of Flow-Time in the Rejection Model Roy Choudhury, Anamitra et al. 2015
8 LIPIcs, Volume 13, FSTTCS'11, Complete Volume Chakraborthy, Supratik et al. 2013
9 Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees Elbassioni, Khaled et al. 2012
10 Efficient on-line algorithm for maintaining k-cover of sparse bit-strings Kumar, Amit et al. 2012
Current Page :
Number of result pages: 2
Number of documents: 13


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