Amit Kumar
Amit Kumar
Computer Science and Engineering, IIT Delhi
Verified email at cse.iitd.ac.in - Homepage
TitleCited byYear
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
3312001
Connectivity and inference problems for temporal networks
D Kempe, J Kleinberg, A Kumar
Journal of Computer and System Sciences 64 (4), 820-842, 2002
3232002
A simple linear time (1+ epsilon)-approximation algorithm for k-means clustering in any dimensions
A Kumar, Y Sabharwal, S Sen
Annual Symposium on Foundations of Computer Science 45, 454-462, 2004
2392004
Simpler and better approximation algorithms for network design
A Gupta, A Kumar, T Roughgarden
STOC 3, 365-372, 2003
1962003
Maximum coverage problem with group budget constraints and applications
C Chekuri, A Kumar
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2004
1872004
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
1572002
Algorithms for provisioning virtual private networks in the hose model
A Kumar, R Rastogi, A Silberschatz, B Yener
ACM SIGCOMM Computer Communication Review 31 (4), 135-146, 2001
1362001
Primal–dual algorithms for connected facility location problems
C Swamy, A Kumar
Algorithmica 40 (4), 245-269, 2004
1302004
Wavelength conversion in optical networks
J Kleinberg, A Kumar
Journal of algorithms 38 (1), 25-50, 2001
1302001
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
1162010
Efficient load-balancing routing for wireless mesh networks
Y Bejerano, SJ Han, A Kumar
Computer Networks 51 (10), 2450-2466, 2007
1132007
Deterministic wavelet thresholding for maximum-error metrics
M Garofalakis, A Kumar
Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on …, 2004
1122004
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
962004
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
892010
Linear-time approximation schemes for clustering problems in any dimensions
A Kumar, Y Sabharwal, S Sen
Journal of the ACM (JACM) 57 (2), 5, 2010
872010
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
832012
Approximation via cost-sharing: a simple approximation algorithm for the multicommodity rent-or-buy problem
A Gupta, A Kumar, M Pál, T Roughgarden
44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003
822003
Approximation via cost sharing: Simpler and better approximation algorithms for network design
A Gupta, A Kumar, T Roughgarden
Journal of the ACM (JACM) 54 (3), 11, 2007
792007
Method and apparatus for routing a packet within a plurality of nodes arranged in a line or a tree given a maximum stack depth
A Gupta, A Kumar, R Rastogi
US Patent 7,542,470, 2009
782009
Approximation algorithms for the unsplittable flow problem
A Chakrabarti, C Chekuri, A Gupta, A Kumar
Algorithmica 47 (1), 53-78, 2007
772007
The system can't perform the operation now. Try again later.
Articles 1–20