Viswanath Nagarajan

ORCID

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 76

Top Venues

Publications

Rayen Tan, Rohan Ghuge, Viswanath Nagarajan
Informative Path Planning with Limited Adaptivity. AISTATS (2024)
Blake Harris, Viswanath Nagarajan
Lower Bound on the Greedy Approximation Ratio for Adaptive Submodular Cover. CoRR (2024)
Viswanath Nagarajan, Lily Wang
Online Generalized Network Design Under (Dis)Economies of Scale. Math. Oper. Res. 49 (1) (2024)
Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Clifford Stein
Cluster Before You Hallucinate: Node-Capacitated Network Design and Energy Efficient Routing. SIAM J. Comput. 53 (3) (2024)
Rohan Ghuge, Anupam Gupta, Viswanath Nagarajan
The Power of Adaptivity for Stochastic Submodular Cover. Oper. Res. 72 (3) (2024)
Yubing Cui, Viswanath Nagarajan
Minimum Cost Adaptive Submodular Cover. SOSA (2023)
Rayen Tan, Rohan Ghuge, Viswanath Nagarajan
Informative Path Planning with Limited Adaptivity. CoRR (2023)
Qi Luo, Viswanath Nagarajan, Alexander Sundt, Yafeng Yin, John Vincent, Mehrdad Shahabi
Efficient Algorithms for Stochastic Ride-Pooling Assignment with Mixed Fleets. Transp. Sci. 57 (4) (2023)
Arpit Agarwal, Rohan Ghuge, Viswanath Nagarajan
Semi-Bandit Learning for Monotone Stochastic Optimization. CoRR (2023)
Su Jia, Fatemeh Navidi, Viswanath Nagarajan, R. Ravi
Optimal Decision Tree with Noisy Outcomes. CoRR (2023)
Yubing Cui, Viswanath Nagarajan
Minimum Cost Adaptive Submodular Cover. CoRR (2022)
Arpit Agarwal, Rohan Ghuge, Viswanath Nagarajan
Batched Dueling Bandits. ICML (2022)
Euiwoong Lee, Viswanath Nagarajan, Lily Wang
On some variants of Euclidean k-supplier. Oper. Res. Lett. 50 (2) (2022)
Arpit Agarwal, Rohan Ghuge, Viswanath Nagarajan
An Asymptotically Optimal Batched Algorithm for the Dueling Bandit Problem. NeurIPS (2022)
Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen
Stochastic makespan minimization in structured set systems. Math. Program. 192 (1) (2022)
Arpit Agarwal, Rohan Ghuge, Viswanath Nagarajan
An Asymptotically Optimal Batched Algorithm for the Dueling Bandit Problem. CoRR (2022)
Arpit Agarwal, Rohan Ghuge, Viswanath Nagarajan
Batched Dueling Bandits. CoRR (2022)
Miao Yu, Viswanath Nagarajan, Siqian Shen
Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization. INFORMS J. Comput. 34 (2) (2022)
Rohan Ghuge, Viswanath Nagarajan
Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems. Math. Oper. Res. 47 (2) (2022)
Rohan Ghuge, Joseph Kwon, Viswanath Nagarajan, Adetee Sharma
Constrained Assortment Optimization Under the Paired Combinatorial Logit Model. Oper. Res. 70 (2) (2022)
Rohan Ghuge, Anupam Gupta, Viswanath Nagarajan
Non-adaptive Stochastic Score Classification and Explainable Halfspace Evaluation. IPCO (2022)
Viswanath Nagarajan, Lily Wang
Online Generalized Network Design Under (Dis)Economies of Scale. SODA (2021)
Euiwoong Lee, Viswanath Nagarajan, Lily Wang
On Some Variants of Euclidean K-Supplier. CoRR (2021)
Rohan Ghuge, Anupam Gupta, Viswanath Nagarajan
Non-Adaptive Stochastic Score Classification and Explainable Halfspace Evaluation. CoRR (2021)
Rohan Ghuge, Anupam Gupta, Viswanath Nagarajan
The Power of Adaptivity for Stochastic Submodular Cover. ICML (2021)
Qi Luo, Viswanath Nagarajan, Alexander Sundt, Yafeng Yin, John Vincent, Mehrdad Shahabi
Efficient Algorithms for Stochastic Ridepooling Assignment with Mixed Fleets. CoRR (2021)
Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen
Stochastic Load Balancing on Unrelated Machines. Math. Oper. Res. 46 (1) (2021)
Rohan Ghuge, Anupam Gupta, Viswanath Nagarajan
The Power of Adaptivity for Stochastic Submodular Cover. CoRR (2021)
Rohan Ghuge, Viswanath Nagarajan
Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Other Directed Network Design Problems. SODA (2020)
Viswanath Nagarajan, Lily Wang
Online Generalized Network Design Under (Dis)Economies of Scale. CoRR (2020)
Fatemeh Navidi, Inge Li Gørtz, Viswanath Nagarajan
Approximation algorithms for the a priori traveling repairman. Oper. Res. Lett. 48 (5) (2020)
Fatemeh Navidi, Prabhanjan Kambadur, Viswanath Nagarajan
Adaptive Submodular Ranking and Routing. Oper. Res. 68 (3) (2020)
Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen
Stochastic Makespan Minimization in Structured Set Systems. CoRR (2020)
Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen
Stochastic Makespan Minimization in Structured Set Systems (Extended Abstract). IPCO (2020)
Viswanath Nagarajan, Baruch Schieber, Hadas Shachnai
-Supplier Problem. Math. Oper. Res. 45 (1) (2020)
Xiangkun Shen, Viswanath Nagarajan
-norm objectives and applications to network design. Math. Program. 184 (1) (2020)
Antonios Antoniadis, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Viswanath Nagarajan, Kirk Pruhs, Clifford Stein
Hallucination Helps: Energy Efficient Virtual Circuit Routing. SIAM J. Comput. 49 (1) (2020)
Viswanath Nagarajan, Joel L. Wolf, Andrey Balmin, Kirsten Hildrum
Malleable scheduling for flows of jobs and applications to MapReduce. J. Sched. 22 (4) (2019)
Su Jia, Viswanath Nagarajan, Fatemeh Navidi, R. Ravi
Optimal Decision Tree with Noisy Outcomes. NeurIPS (2019)
Inge Li Gørtz, Viswanath Nagarajan, Fatemeh Navidi
Approximation Algorithms for the A Priori TravelingRepairman. CoRR (2019)
Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen
Stochastic Load Balancing on Unrelated Machines. CoRR (2019)
Rohan Ghuge, Viswanath Nagarajan
A Quasi-Polynomial Algorithm for Submodular Tree Orienteering in Directed Graphs. CoRR (2018)
Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen
Stochastic Load Balancing on Unrelated Machines. SODA (2018)
Martin Koutecký, Jon Lee, Viswanath Nagarajan, Xiangkun Shen
Approximating max-cut under graph-MSO constraints. Oper. Res. Lett. 46 (6) (2018)
Xiangkun Shen, Jon Lee, Viswanath Nagarajan
Approximating graph-constrained max-cut. Math. Program. 172 (1-2) (2018)
Miao Yu, Viswanath Nagarajan, Siqian Shen
An approximation algorithm for vehicle routing with compatibility constraints. Oper. Res. Lett. 46 (6) (2018)
Martin Koutecký, Jon Lee, Viswanath Nagarajan, Xiangkun Shen
Approximating Max-Cut under Graph-MSO Constraints. CoRR (2018)
Alina Ene, Viswanath Nagarajan, Rishi Saket
Approximation Algorithms for Stochastic k-TSP. FSTTCS (2017)
Anupam Gupta, Viswanath Nagarajan, R. Ravi
Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems. Math. Oper. Res. 42 (3) (2017)
Miao Yu, Viswanath Nagarajan, Siqian Shen
Minimum Makespan Vehicle Routing Problem with Compatibility Constraints. CPAIOR (2017)
Anupam Gupta, Viswanath Nagarajan, Sahil Singla
Adaptivity Gaps for Stochastic Probing: Submodular and XOS Functions. SODA (2017)
Viswanath Nagarajan, Xiangkun Shen
Online Covering with Sum of $ell_q$-Norm Objectives. ICALP (2017)
Prabhanjan Kambadur, Viswanath Nagarajan, Fatemeh Navidi
Adaptive Submodular Ranking. IPCO (2017)
Viswanath Nagarajan, Xiangkun Shen
Online Covering with Sum of $\ell_q$-Norm Objectives. CoRR (2017)
Fatemeh Navidi, Prabhanjan Kambadur, Viswanath Nagarajan
Adaptive Submodular Ranking. CoRR (2016)
Nikhil Bansal, Viswanath Nagarajan
Approximation-Friendly Discrepancy Rounding. IPCO (2016)
Sungjin Im, Viswanath Nagarajan, Ruben van der Zwaan
Minimum Latency Submodular Cover. ACM Trans. Algorithms 13 (1) (2016)
Anupam Gupta, Viswanath Nagarajan, Sahil Singla
Algorithms and Adaptivity Gaps for Stochastic Probing. SODA (2016)
Yossi Azar, Niv Buchbinder, T.-H. Hubert Chan, Shahar Chen, Ilan Reuven Cohen, Anupam Gupta, Zhiyi Huang, Ning Kang, Viswanath Nagarajan, Joseph Naor, Debmalya Panigrahi
Online Algorithms for Covering and Packing Problems with Convex Objectives. FOCS (2016)
Maxim A. Babenko, Andrew V. Goldberg, Anupam Gupta, Viswanath Nagarajan
Algorithms for Hub Label Optimization. ACM Trans. Algorithms 13 (1) (2016)
Jon Lee, Viswanath Nagarajan, Xiangkun Shen
Max-Cut Under Graph Constraints. IPCO (2016)
Anupam Gupta, Viswanath Nagarajan, R. Ravi
Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets. ACM Trans. Algorithms 12 (1) (2016)
Viswanath Nagarajan, Cong Shi
Approximation algorithms for inventory problems with submodular or routing costs. Math. Program. 160 (1-2) (2016)
Inge Li Gørtz, Marco Molinaro, Viswanath Nagarajan, R. Ravi
Capacitated Vehicle Routing with Nonuniform Speeds. Math. Oper. Res. 41 (1) (2016)
Inge Li Gørtz, Viswanath Nagarajan
Locating depots for capacitated vehicle routing. Networks 68 (2) (2016)
Anupam Gupta, Viswanath Nagarajan, Sahil Singla
Adaptivity Gaps for Stochastic Probing: Submodular and XOS Functions. CoRR (2016)
Alina Ene, Viswanath Nagarajan, Rishi Saket
Approximation Algorithms for Stochastic k-TSP. CoRR (2016)
Nikhil Bansal, Kang-Won Lee, Viswanath Nagarajan, Murtaza Zafer
Minimum Congestion Mapping in a Cloud. SIAM J. Comput. 44 (3) (2015)
Jon Lee, Viswanath Nagarajan, Xiangkun Shen
Max-Cut under Graph Constraints. CoRR (2015)
Inge Li Gørtz, Viswanath Nagarajan, R. Ravi
Minimum Makespan Multi-Vehicle Dial-a-Ride. ACM Trans. Algorithms 11 (3) (2015)
Nikhil Bansal, Viswanath Nagarajan
On the adaptivity gap of stochastic orienteering. Math. Program. 154 (1-2) (2015)
Viswanath Nagarajan, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai, Joel L. Wolf
The Container Selection Problem. APPROX-RANDOM (2015)
Viswanath Nagarajan, Cong Shi
Approximation Algorithms for Inventory Problems with Submodular or Routing Costs. CoRR (2015)
Ravishankar Krishnaswamy, Amit Kumar, Viswanath Nagarajan, Yogish Sabharwal, Barna Saha
Facility Location with Matroid or Knapsack Constraints. Math. Oper. Res. 40 (2) (2015)
Nikhil Bansal, Viswanath Nagarajan
Approximation-Friendly Discrepancy Rounding. CoRR (2015)
Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi
Running Errands in Time: Approximation Algorithms for Stochastic Orienteering. Math. Oper. Res. 40 (1) (2015)
Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein
Cluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient Routing. CoRR (2014)
Nikhil Bansal, Viswanath Nagarajan
On the Adaptivity Gap of Stochastic Orienteering. IPCO (2014)
Nikhil Bansal, Ravishankar Krishnaswamy, Viswanath Nagarajan
Better Scalable Algorithms for Broadcast Scheduling. ACM Trans. Algorithms 11 (1) (2014)
Niv Buchbinder, Shahar Chen, Anupam Gupta, Viswanath Nagarajan, Joseph Naor
Online Packing and Covering Framework with Convex Objectives. CoRR (2014)
Anupam Gupta, Viswanath Nagarajan
Approximating Sparse Covering Integer Programs Online. Math. Oper. Res. 39 (4) (2014)
Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein
Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routing. STOC (2014)
Joel L. Wolf, Zubair Nabi, Viswanath Nagarajan, Robert Saccone, Rohit Wagle, Kirsten Hildrum, Edward Pring, Kanthi K. Sarpatwar
The X-flex cross-platform scheduler: who's the fairest of them all? Middleware (Industry Track) (2014)
Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz
Min-Max Graph Partitioning and Small Set Expansion. SIAM J. Comput. 43 (2) (2014)
Antonios Antoniadis, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein
Hallucination Helps: Energy Efficient Virtual Circuit Routing. SODA (2014)
Anupam Gupta, Viswanath Nagarajan, R. Ravi
Thresholded covering algorithms for robust and max-min optimization. Math. Program. 146 (1-2) (2014)
Maxim A. Babenko, Andrew V. Goldberg, Anupam Gupta, Viswanath Nagarajan
Algorithms for Hub Label Optimization. ICALP (1) (2013)
Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis
On generalizations of network design problems with degree bounds. Math. Program. 141 (1-2) (2013)
Anupam Gupta, Viswanath Nagarajan, Vijay V. Vazirani
Thrifty Algorithms for Multistage Robust Optimization CoRR (2013)
Anupam Gupta, Viswanath Nagarajan
A Stochastic Probing Problem with Applications. IPCO (2013)
Anupam Gupta, Viswanath Nagarajan, Vijay V. Vazirani
Thrifty Algorithms for Multistage Robust Optimization. IPCO (2013)
Anupam Gupta, Viswanath Nagarajan
A Stochastic Probing Problem with Applications CoRR (2013)
Anupam Gupta, Satyen Kale, Viswanath Nagarajan, Rishi Saket, Baruch Schieber
The Approximability of the Binary Paintshop Problem. APPROX-RANDOM (2013)
Viswanath Nagarajan, Joel L. Wolf, Andrey Balmin, Kirsten Hildrum
FlowFlex: Malleable Scheduling for Flows of MapReduce Jobs. Middleware (2013)
Viswanath Nagarajan, Baruch Schieber, Hadas Shachnai
The Euclidean k-Supplier Problem. IPCO (2013)
Nikhil Bansal, Viswanath Nagarajan
On the Adaptivity Gap of Stochastic Orienteering. CoRR (2013)
Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi
Approximation algorithms for stochastic orienteering. SODA (2012)
Sungjin Im, Viswanath Nagarajan, Ruben van der Zwaan
Minimum Latency Submodular Cover. ICALP (1) (2012)
Inge Li Gørtz, Viswanath Nagarajan, Rishi Saket
Stochastic Vehicle Routing with Recourse CoRR (2012)
Anupam Gupta, Viswanath Nagarajan
Approximating Sparse Covering Integer Programs Online CoRR (2012)

Viswanath Nagarajan.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Viswanath Nagarajan