| Year |
Citation |
Score |
| 2019 |
Ban F, Jain K, Papadimitriou CH, Psomas C, Rubinstein A. Reductions in PPP Information Processing Letters. 145: 48-52. DOI: 10.1016/J.Ipl.2018.12.009 |
0.343 |
|
| 2011 |
Alaei S, Jain K, Malekian A. Competitive equilibrium in two sided matching markets with general utility functions Sigecom Exchanges. 10: 34-36. DOI: 10.1145/1998549.1998556 |
0.313 |
|
| 2010 |
Jain K, Vazirani VV. Eisenberg-Gale markets: Algorithms and game-theoretic properties Games and Economic Behavior. 70: 84-106. DOI: 10.1016/J.Geb.2008.11.011 |
0.561 |
|
| 2009 |
Buchbinder N, Jain K, Singh M. Secretary problems and incentives via linear programming Sigecom Exchanges. 8: 6. DOI: 10.1145/1980522.1980528 |
0.312 |
|
| 2007 |
Jain K. A Polynomial Time Algorithm for Computing an Arrow-Debreu Market Equilibrium for Linear Utilities Siam Journal On Computing. 37: 303-318. DOI: 10.1137/S0097539705447384 |
0.421 |
|
| 2007 |
Bahl P, Hajiaghayi MT, Jain K, Mirrokni SV, Qiu L, Saberi A. Cell Breathing in Wireless LANs: Algorithms and Evaluation Ieee Transactions On Mobile Computing. 6: 164-178. DOI: 10.1109/Tmc.2007.20 |
0.372 |
|
| 2007 |
Hegde R, Jain K. The Hardness of Approximating Poset Dimension Electronic Notes in Discrete Mathematics. 29: 435-443. DOI: 10.1016/J.Endm.2007.07.084 |
0.364 |
|
| 2007 |
Jain K, Lovász L, Chou PA. Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding Distributed Computing. 19: 301-311. DOI: 10.1007/S00446-006-0014-9 |
0.305 |
|
| 2006 |
Jain K, Vazirani VV, Yuval G. On the capacity of multiple unicast sessions in undirected graphs Ieee Transactions On Information Theory. 52: 2805-2809. DOI: 10.1109/Tit.2006.874543 |
0.566 |
|
| 2006 |
Ramamoorthy A, Jain K, Chou P, Effros M. Separating distributed source coding from network coding Ieee Transactions On Information Theory. 52: 2785-2795. DOI: 10.1109/Tit.2006.874534 |
0.348 |
|
| 2006 |
Wu Y, Jain K, Kung S. A unification of network coding and tree-packing (routing) theorems Ieee Transactions On Information Theory. 14: 2398-2409. DOI: 10.1109/Tit.2006.874430 |
0.361 |
|
| 2006 |
Fleischer L, Jain K, Williamson DP. Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems Journal of Computer and System Sciences. 72: 838-867. DOI: 10.1016/J.Jcss.2005.05.006 |
0.532 |
|
| 2005 |
Jaggi S, Sanders P, Chou P, Effros M, Egner S, Jain K, Tolhuizen L. Polynomial Time Algorithms for Multicast Network Code Construction Ieee Transactions On Information Theory. 51: 1973-1982. DOI: 10.1109/Tit.2005.847712 |
0.399 |
|
| 2003 |
Jain K, Mahdian M, Markakis E, Saberi A, Vazirani VV. Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP Journal of the Acm. 50: 795-824. DOI: 10.1145/950620.950621 |
0.617 |
|
| 2003 |
Jain K, Vazirani VV. An approximation algorithm for the fault tolerant metric facility location problem Algorithmica (New York). 38: 433-439. DOI: 10.1007/S00453-003-1070-1 |
0.629 |
|
| 2002 |
Jain K, Vazirani VV. Equitable cost allocations via primal-dual-type algorithms Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 313-321. DOI: 10.1137/060658448 |
0.534 |
|
| 2002 |
Jain K, Mǎndoiu I, Vazirani VV, Williamson DP. A primal-dual schema based approximation algorithm for the element connectivity problem Journal of Algorithms. 45: 1-15. DOI: 10.1016/S0196-6774(02)00222-5 |
0.656 |
|
| 2001 |
Jain K, Vazirani VV. Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation Journal of the Acm. 48: 274-296. DOI: 10.1145/375827.375845 |
0.632 |
|
| 2001 |
Jain K. A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem Combinatorica. 21: 39-60. DOI: 10.1007/S004930170004 |
0.478 |
|
| Show low-probability matches. |