Viswanath Nagarajan
Cited by
Cited by
Maximizing nonmonotone submodular functions under matroid or knapsack constraints
J Lee, VS Mirrokni, V Nagarajan, M Sviridenko
SIAM Journal on Discrete Mathematics 23 (4), 2053-2078, 2010
When LP is the cure for your matching woes: Improved bounds for stochastic matchings
N Bansal, A Gupta, J Li, J Mestre, V Nagarajan, A Rudra
Algorithmica 63 (4), 733-762, 2012
Additive guarantees for degree-bounded directed network design
N Bansal, R Khandekar, V Nagarajan
SIAM Journal on Computing 39 (4), 1413-1431, 2010
Minimum congestion mapping in a cloud
N Bansal, KW Lee, V Nagarajan, M Zafer
SIAM Journal on Computing 44 (3), 819-843, 2015
Approximation algorithms for distance constrained vehicle routing problems
V Nagarajan, R Ravi
Networks 59 (2), 209-214, 2012
Solving packing integer programs via randomized rounding with alterations
N Bansal, N Korula, V Nagarajan, A Srinivasan
Theory of Computing 8 (1), 533-565, 2012
Min-max graph partitioning and small set expansion
N Bansal, U Feige, R Krauthgamer, K Makarychev, V Nagarajan, J Seffi, ...
SIAM Journal on Computing 43 (2), 872-904, 2014
A stochastic probing problem with applications
A Gupta, V Nagarajan
International Conference on Integer Programming and Combinatorial …, 2013
Approximation algorithms for optimal decision trees and adaptive TSP problems
A Gupta, V Nagarajan, R Ravi
Mathematics of Operations Research 42 (3), 876-896, 2017
Running errands in time: Approximation algorithms for stochastic orienteering
A Gupta, R Krishnaswamy, V Nagarajan, R Ravi
Mathematics of Operations Research 40 (1), 56-79, 2015
Facility location with matroid or knapsack constraints
R Krishnaswamy, A Kumar, V Nagarajan, Y Sabharwal, B Saha
Mathematics of Operations Research 40 (2), 446-459, 2015
Approximating the k-multicut problem
D Golovin, V Nagarajan, M Singh
SODA 6, 621-630, 2006
The directed orienteering problem
V Nagarajan, R Ravi
Algorithmica 60 (4), 1017-1030, 2011
Fairness and optimality in congestion games
D Chakrabarty, A Mehta, V Nagarajan
Proceedings of the 6th ACM Conference on Electronic Commerce, 52-57, 2005
Dial a Ride from k-forest
A Gupta, MT Hajiaghayi, V Nagarajan, R Ravi
ACM Transactions on Algorithms (TALG) 6 (2), 1-21, 2010
Adaptivity gaps for stochastic probing: Submodular and XOS functions
A Gupta, V Nagarajan, S Singla
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
Online algorithms for covering and packing problems with convex objectives
Y Azar, N Buchbinder, THH Chan, S Chen, IR Cohen, A Gupta, Z Huang, ...
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016
Better scalable algorithms for broadcast scheduling
N Bansal, R Krishnaswamy, V Nagarajan
ACM Transactions on Algorithms (TALG) 11 (1), 1-24, 2014
Algorithms and adaptivity gaps for stochastic probing
A Gupta, V Nagarajan, S Singla
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
Thresholded covering algorithms for robust and max–min optimization
A Gupta, V Nagarajan, R Ravi
Mathematical Programming 146 (1), 583-615, 2014
The system can't perform the operation now. Try again later.
Articles 1–20