Travelled to:1 × Canada
1 × France
1 × Latvia
1 × United Kingdom
2 × USA
Collaborated with:A.Gupta N.Bansal R.Ravi R.Krishnaswamy I.L.Gørtz R.Saket S.Im R.v.d.Zwaan R.Khandekar K.Pruhs C.Stein M.A.Babenko A.V.Goldberg J.Lee V.S.Mirrokni M.Sviridenko
Talks about:algorithm (4) approxim (3) optim (3) cover (3) submodular (2) network (2) design (2) rout (2) constraint (1) threshold (1)
Person: Viswanath Nagarajan
DBLP: Nagarajan:Viswanath
Contributed to:
2014
20132012201020092008Wrote 10 papers:
- STOC-2014-KrishnaswamyNPS #approximate #clustering #design #energy #network #performance
- Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routing (RK, VN, KP, CS), pp. 734–743.
- ICALP-v1-2013-BabenkoGGN #algorithm #optimisation
- Algorithms for Hub Label Optimization (MAB, AVG, AG, VN), pp. 69–80.
- ICALP-v1-2012-GortzNS #probability
- Stochastic Vehicle Routing with Recourse (ILG, VN, RS), pp. 411–423.
- ICALP-v1-2012-GuptaN #approximate #integer #online #source code
- Approximating Sparse Covering Integer Programs Online (AG, VN), pp. 436–448.
- ICALP-v1-2012-ImNZ #latency
- Minimum Latency Submodular Cover (SI, VN, RvdZ), pp. 485–497.
- ICALP-v1-2010-BansalKN #algorithm #scalability #scheduling
- Better Scalable Algorithms for Broadcast Scheduling (NB, RK, VN), pp. 324–335.
- ICALP-v1-2010-GuptaNR #algorithm #optimisation #robust
- Thresholded Covering Algorithms for Robust and Max-min Optimization (AG, VN, RR), pp. 262–274.
- ICALP-v1-2010-GuptaNR10a #adaptation #algorithm #approximate #problem
- Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems (AG, VN, RR), pp. 690–701.
- STOC-2009-LeeMNS #constraints
- Non-monotone submodular maximization under matroid and knapsack constraints (JL, VSM, VN, MS), pp. 323–332.
- STOC-2008-BansalKN #bound #design #network
- Additive guarantees for degree bounded directed network design (NB, RK, VN), pp. 769–778.