Publications

Export 5 results:
Author [ Title(Desc)] Type Year
Filters: Keyword is Randomized rounding  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
A
Gandhi R, Khuller S, Srinivasan A.  2004.  Approximation algorithms for partial covering problems. Journal of Algorithms. 53(1):55-84.
C
Srinivasan A, Teo C-P.  1997.  A constant-factor approximation algorithm for packet routing, and balancing local vs. global criteria. Proceedings of the twenty-ninth annual ACM symposium on Theory of computing. :636-643.
D
Gandhi R, Khuller S, Parthasarathy S, Srinivasan A.  2006.  Dependent rounding and its applications to approximation algorithms. Journal of the ACM. 53(3):324-360.
I
Gandhi R, Halperin E, Khuller S, Kortsarz G, Srinivasan A.  2006.  An improved approximation algorithm for vertex cover with hard capacities. Journal of Computer and System Sciences. 72(1):16-33.
U
Kumar AVS, Marathe MV, Parthasarathy S, Srinivasan A.  2009.  A unified approach to scheduling on unrelated parallel machines. J. ACM. 56(5):28:1–28:31-28:1–28:31.