Följ
Amit Kumar
Amit Kumar
Computer Science and Engineering, IIT Delhi
Verifierad e-postadress på cse.iitd.ac.in - Startsida
Titel
Citeras av
Citeras av
År
Connectivity and inference problems for temporal networks
D Kempe, J Kleinberg, A Kumar
Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000
5962000
Provisioning a virtual private network: a network design problem for multicommodity flow
A Gupta, J Kleinberg, A Kumar, R Rastogi, B Yener
Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001
4072001
A simple linear time (1+/spl epsiv/)-approximation algorithm for k-means clustering in any dimensions
A Kumar, Y Sabharwal, S Sen
45th Annual IEEE Symposium on Foundations of Computer Science, 454-462, 2004
3862004
Maximum coverage problem with group budget constraints and applications
C Chekuri, A Kumar
International Workshop on Randomization and Approximation Techniques in …, 2004
2682004
Clustering with spectral norm and the k-means algorithm
A Kumar, R Kannan
2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 299-308, 2010
2332010
Simpler and better approximation algorithms for network design
A Gupta, A Kumar, T Roughgarden
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003
2142003
Algorithms for provisioning virtual private networks in the hose model
A Kumar, R Rastogi, A Silberschatz, B Yener
IEEE/ACM transactions on networking 10 (4), 565-578, 2002
1792002
Primal–dual algorithms for connected facility location problems
C Swamy, A Kumar
Algorithmica 40, 245-269, 2004
1592004
Wavelength conversion in optical networks
J Kleinberg, A Kumar
Journal of algorithms 38 (1), 25-50, 2001
1592001
Linear-time approximation schemes for clustering problems in any dimensions
A Kumar, Y Sabharwal, S Sen
Journal of the ACM (JACM) 57 (2), 1-32, 2010
1542010
Algorithms for provisioning virtual private networks in the hose model
A Kumar, R Rastogi, A Silberschatz, B Yener
Proceedings of the 2001 conference on Applications, technologies …, 2001
1432001
Deterministic wavelet thresholding for maximum-error metrics
M Garofalakis, A Kumar
Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on …, 2004
1352004
Resource augmentation for weighted flow-time explained by dual fitting
S Anand, N Garg, A Kumar
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
1262012
Assigning papers to referees
N Garg, T Kavitha, A Kumar, K Mehlhorn, J Mestre
Algorithmica 58, 119-136, 2010
1232010
Efficient load-balancing routing for wireless mesh networks
Y Bejerano, SJ Han, A Kumar
Computer Networks 51 (10), 2450-2466, 2007
1172007
Approximation algorithms for the unsplittable flow problem
A Chakrabarti, C Chekuri, A Gupta, A Kumar
Algorithmica 47 (1), 53-78, 2007
1152007
Multi-processor scheduling to minimize flow time with ε resource augmentation
C Chekuri, A Goel, S Khanna, A Kumar
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing …, 2004
1132004
Method for distinct count estimation over joins of continuous update stream
S Ganguly, MN Garofalakis, A Kumar, R Rastogi
US Patent 7,668,856, 2010
962010
Fairness measures for resource allocation
A Kumar, J Kleinberg
Proceedings 41st annual symposium on foundations of computer science, 75-85, 2000
932000
Approximation via cost sharing: Simpler and better approximation algorithms for network design
A Gupta, A Kumar, M P´ al, T Roughgarden
Journal of the ACM (JACM) 54 (3), 11-es, 2007
862007
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20