default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDViswanath Nagarajan
Person information
- affiliation: University of Michigan, Ann Arbor, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[i45]Blake Harris, Viswanath Nagarajan, Rayen Tan:
Sequential Testing with Subadditive Costs. CoRR abs/2501.18010 (2025)- 2024
- [j52]Rohan Ghuge, Anupam Gupta, Viswanath Nagarajan
:
The Power of Adaptivity for Stochastic Submodular Cover. Oper. Res. 72(3): 1156-1176 (2024) - [j51]Viswanath Nagarajan, Lily Wang:
Online Generalized Network Design Under (Dis)Economies of Scale. Math. Oper. Res. 49(1): 107-124 (2024) - [j50]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): 588-623 (2024) - [c61]Rayen Tan, Rohan Ghuge, Viswanath Nagarajan:
Informative Path Planning with Limited Adaptivity. AISTATS 2024: 4006-4014 - [c60]Arpit Agarwal, Rohan Ghuge, Viswanath Nagarajan:
Semi-Bandit Learning for Monotone Stochastic Optimization. FOCS 2024: 1260-1274 - [i44]Blake Harris, Viswanath Nagarajan:
Lower Bound on the Greedy Approximation Ratio for Adaptive Submodular Cover. CoRR abs/2405.14995 (2024) - 2023
- [j49]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): 908-936 (2023) - [c59]Yubing Cui, Viswanath Nagarajan:
Minimum Cost Adaptive Submodular Cover. SOSA 2023: 12-27 - [e2]Nikhil Bansal, Viswanath Nagarajan:
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023. SIAM 2023, ISBN 978-1-61197-755-4 [contents] - [i43]Rayen Tan, Rohan Ghuge, Viswanath Nagarajan:
Informative Path Planning with Limited Adaptivity. CoRR abs/2311.12698 (2023) - [i42]Su Jia, Fatemeh Navidi, Viswanath Nagarajan, R. Ravi:
Optimal Decision Tree with Noisy Outcomes. CoRR abs/2312.15357 (2023) - [i41]Arpit Agarwal, Rohan Ghuge, Viswanath Nagarajan:
Semi-Bandit Learning for Monotone Stochastic Optimization. CoRR abs/2312.15427 (2023) - 2022
- [j48]Miao Yu, Viswanath Nagarajan, Siqian Shen:
Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization. INFORMS J. Comput. 34(2): 953-973 (2022) - [j47]Rohan Ghuge, Joseph Kwon, Viswanath Nagarajan, Adetee Sharma:
Constrained Assortment Optimization Under the Paired Combinatorial Logit Model. Oper. Res. 70(2): 786-804 (2022) - [j46]Rohan Ghuge, Viswanath Nagarajan:
Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems. Math. Oper. Res. 47(2): 1612-1630 (2022) - [j45]Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen:
Stochastic makespan minimization in structured set systems. Math. Program. 192(1): 597-630 (2022) - [j44]Euiwoong Lee, Viswanath Nagarajan, Lily Wang:
On some variants of Euclidean k-supplier. Oper. Res. Lett. 50(2): 115-121 (2022) - [c58]Arpit Agarwal, Rohan Ghuge, Viswanath Nagarajan:
Batched Dueling Bandits. ICML 2022: 89-110 - [c57]Rohan Ghuge, Anupam Gupta, Viswanath Nagarajan:
Non-adaptive Stochastic Score Classification and Explainable Halfspace Evaluation. IPCO 2022: 277-290 - [c56]Arpit Agarwal, Rohan Ghuge, Viswanath Nagarajan:
An Asymptotically Optimal Batched Algorithm for the Dueling Bandit Problem. NeurIPS 2022 - [i40]Arpit Agarwal, Rohan Ghuge, Viswanath Nagarajan:
Batched Dueling Bandits. CoRR abs/2202.10660 (2022) - [i39]Yubing Cui, Viswanath Nagarajan:
Minimum Cost Adaptive Submodular Cover. CoRR abs/2208.08351 (2022) - [i38]Arpit Agarwal, Rohan Ghuge, Viswanath Nagarajan:
An Asymptotically Optimal Batched Algorithm for the Dueling Bandit Problem. CoRR abs/2209.12108 (2022) - 2021
- [j43]Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen:
Stochastic Load Balancing on Unrelated Machines. Math. Oper. Res. 46(1): 115-133 (2021) - [c55]Rohan Ghuge, Anupam Gupta, Viswanath Nagarajan:
The Power of Adaptivity for Stochastic Submodular Cover. ICML 2021: 3702-3712 - [c54]Viswanath Nagarajan, Lily Wang:
Online Generalized Network Design Under (Dis)Economies of Scale. SODA 2021: 2819-2829 - [i37]Rohan Ghuge, Anupam Gupta, Viswanath Nagarajan:
The Power of Adaptivity for Stochastic Submodular Cover. CoRR abs/2106.16115 (2021) - [i36]Qi Luo, Viswanath Nagarajan, Alexander Sundt, Yafeng Yin, John Vincent, Mehrdad Shahabi:
Efficient Algorithms for Stochastic Ridepooling Assignment with Mixed Fleets. CoRR abs/2108.08651 (2021) - [i35]Rohan Ghuge, Anupam Gupta, Viswanath Nagarajan:
Non-Adaptive Stochastic Score Classification and Explainable Halfspace Evaluation. CoRR abs/2111.05687 (2021) - [i34]Euiwoong Lee, Viswanath Nagarajan, Lily Wang:
On Some Variants of Euclidean K-Supplier. CoRR abs/2112.01700 (2021) - 2020
- [j42]Fatemeh Navidi, Prabhanjan Kambadur, Viswanath Nagarajan:
Adaptive Submodular Ranking and Routing. Oper. Res. 68(3): 856-877 (2020) - [j41]Viswanath Nagarajan, Baruch Schieber, Hadas Shachnai:
The Euclidean k-Supplier Problem. Math. Oper. Res. 45(1): 1-14 (2020) - [j40]Xiangkun Shen, Viswanath Nagarajan:
Online covering with ℓ q-norm objectives and applications to network design. Math. Program. 184(1): 155-182 (2020) - [j39]Fatemeh Navidi, Inge Li Gørtz, Viswanath Nagarajan:
Approximation algorithms for the a priori traveling repairman. Oper. Res. Lett. 48(5): 599-606 (2020) - [j38]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): 37-66 (2020) - [c53]Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen:
Stochastic Makespan Minimization in Structured Set Systems (Extended Abstract). IPCO 2020: 158-170 - [c52]Rohan Ghuge, Viswanath Nagarajan:
Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Other Directed Network Design Problems. SODA 2020: 1039-1048 - [i33]Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen:
Stochastic Makespan Minimization in Structured Set Systems. CoRR abs/2002.11153 (2020) - [i32]Viswanath Nagarajan, Lily Wang:
Online Generalized Network Design Under (Dis)Economies of Scale. CoRR abs/2007.07721 (2020)
2010 – 2019
- 2019
- [j37]Viswanath Nagarajan, Joel L. Wolf, Andrey Balmin, Kirsten Hildrum:
Malleable scheduling for flows of jobs and applications to MapReduce. J. Sched. 22(4): 393-411 (2019) - [c51]Su Jia, Viswanath Nagarajan, Fatemeh Navidi, R. Ravi:
Optimal Decision Tree with Noisy Outcomes. NeurIPS 2019: 3298-3308 - [e1]Andrea Lodi, Viswanath Nagarajan:
Integer Programming and Combinatorial Optimization - 20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings. Lecture Notes in Computer Science 11480, Springer 2019, ISBN 978-3-030-17952-6 [contents] - [i31]Inge Li Gørtz, Viswanath Nagarajan, Fatemeh Navidi:
Approximation Algorithms for the A Priori TravelingRepairman. CoRR abs/1901.06581 (2019) - [i30]Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen:
Stochastic Load Balancing on Unrelated Machines. CoRR abs/1904.07271 (2019) - 2018
- [j36]Xiangkun Shen, Jon Lee, Viswanath Nagarajan:
Approximating graph-constrained max-cut. Math. Program. 172(1-2): 35-58 (2018) - [j35]Miao Yu, Viswanath Nagarajan, Siqian Shen:
An approximation algorithm for vehicle routing with compatibility constraints. Oper. Res. Lett. 46(6): 579-584 (2018) - [j34]Martin Koutecký, Jon Lee, Viswanath Nagarajan, Xiangkun Shen:
Approximating max-cut under graph-MSO constraints. Oper. Res. Lett. 46(6): 592-598 (2018) - [c50]Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen:
Stochastic Load Balancing on Unrelated Machines. SODA 2018: 1274-1285 - [i29]Martin Koutecký, Jon Lee, Viswanath Nagarajan, Xiangkun Shen:
Approximating Max-Cut under Graph-MSO Constraints. CoRR abs/1803.05718 (2018) - [i28]Rohan Ghuge, Viswanath Nagarajan:
A Quasi-Polynomial Algorithm for Submodular Tree Orienteering in Directed Graphs. CoRR abs/1812.01768 (2018) - 2017
- [j33]Anupam Gupta, Viswanath Nagarajan, R. Ravi:
Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems. Math. Oper. Res. 42(3): 876-896 (2017) - [c49]Miao Yu, Viswanath Nagarajan, Siqian Shen:
Minimum Makespan Vehicle Routing Problem with Compatibility Constraints. CPAIOR 2017: 244-253 - [c48]Alina Ene, Viswanath Nagarajan, Rishi Saket:
Approximation Algorithms for Stochastic k-TSP. FSTTCS 2017: 27:27-27:14 - [c47]Viswanath Nagarajan, Xiangkun Shen:
Online Covering with Sum of $ell_q$-Norm Objectives. ICALP 2017: 12:1-12:12 - [c46]Prabhanjan Kambadur, Viswanath Nagarajan, Fatemeh Navidi:
Adaptive Submodular Ranking. IPCO 2017: 317-329 - [c45]Anupam Gupta, Viswanath Nagarajan, Sahil Singla:
Adaptivity Gaps for Stochastic Probing: Submodular and XOS Functions. SODA 2017: 1688-1702 - [i27]Viswanath Nagarajan, Xiangkun Shen:
Online Covering with Sum of $\ell_q$-Norm Objectives. CoRR abs/1705.02194 (2017) - 2016
- [j32]Inge Li Gørtz, Marco Molinaro, Viswanath Nagarajan, R. Ravi:
Capacitated Vehicle Routing with Nonuniform Speeds. Math. Oper. Res. 41(1): 318-331 (2016) - [j31]Viswanath Nagarajan, Cong Shi:
Approximation algorithms for inventory problems with submodular or routing costs. Math. Program. 160(1-2): 225-244 (2016) - [j30]Inge Li Gørtz, Viswanath Nagarajan:
Locating depots for capacitated vehicle routing. Networks 68(2): 94-103 (2016) - [j29]Anupam Gupta, Viswanath Nagarajan, R. Ravi:
Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets. ACM Trans. Algorithms 12(1): 10:1-10:21 (2016) - [j28]Sungjin Im, Viswanath Nagarajan, Ruben van der Zwaan:
Minimum Latency Submodular Cover. ACM Trans. Algorithms 13(1): 13:1-13:28 (2016) - [j27]Maxim A. Babenko, Andrew V. Goldberg, Anupam Gupta, Viswanath Nagarajan:
Algorithms for Hub Label Optimization. ACM Trans. Algorithms 13(1): 16:1-16:17 (2016) - [c44]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: 148-157 - [c43]Jon Lee, Viswanath Nagarajan, Xiangkun Shen:
Max-Cut Under Graph Constraints. IPCO 2016: 50-62 - [c42]Nikhil Bansal, Viswanath Nagarajan:
Approximation-Friendly Discrepancy Rounding. IPCO 2016: 375-386 - [c41]Anupam Gupta, Viswanath Nagarajan, Sahil Singla:
Algorithms and Adaptivity Gaps for Stochastic Probing. SODA 2016: 1731-1747 - [r1]Viswanath Nagarajan:
Stochastic Knapsack. Encyclopedia of Algorithms 2016: 2107-2110 - [i26]Fatemeh Navidi, Prabhanjan Kambadur, Viswanath Nagarajan:
Adaptive Submodular Ranking. CoRR abs/1606.01530 (2016) - [i25]Anupam Gupta, Viswanath Nagarajan, Sahil Singla:
Adaptivity Gaps for Stochastic Probing: Submodular and XOS Functions. CoRR abs/1608.00673 (2016) - [i24]Alina Ene, Viswanath Nagarajan, Rishi Saket:
Approximation Algorithms for Stochastic k-TSP. CoRR abs/1610.01058 (2016) - 2015
- [j26]Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi:
Running Errands in Time: Approximation Algorithms for Stochastic Orienteering. Math. Oper. Res. 40(1): 56-79 (2015) - [j25]Ravishankar Krishnaswamy, Amit Kumar, Viswanath Nagarajan, Yogish Sabharwal, Barna Saha:
Facility Location with Matroid or Knapsack Constraints. Math. Oper. Res. 40(2): 446-459 (2015) - [j24]Nikhil Bansal, Viswanath Nagarajan:
On the adaptivity gap of stochastic orienteering. Math. Program. 154(1-2): 145-172 (2015) - [j23]Nikhil Bansal, Kang-Won Lee, Viswanath Nagarajan, Murtaza Zafer:
Minimum Congestion Mapping in a Cloud. SIAM J. Comput. 44(3): 819-843 (2015) - [j22]Inge Li Gørtz, Viswanath Nagarajan, R. Ravi:
Minimum Makespan Multi-Vehicle Dial-a-Ride. ACM Trans. Algorithms 11(3): 23:1-23:29 (2015) - [c40]Viswanath Nagarajan, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai, Joel L. Wolf:
The Container Selection Problem. APPROX-RANDOM 2015: 416-434 - [i23]Viswanath Nagarajan, Cong Shi:
Approximation Algorithms for Inventory Problems with Submodular or Routing Costs. CoRR abs/1504.06560 (2015) - [i22]Jon Lee, Viswanath Nagarajan, Xiangkun Shen:
Max-Cut under Graph Constraints. CoRR abs/1511.08152 (2015) - [i21]Nikhil Bansal, Viswanath Nagarajan:
Approximation-Friendly Discrepancy Rounding. CoRR abs/1512.02254 (2015) - 2014
- [j21]Anupam Gupta, Viswanath Nagarajan:
Approximating Sparse Covering Integer Programs Online. Math. Oper. Res. 39(4): 998-1011 (2014) - [j20]Anupam Gupta, Viswanath Nagarajan, R. Ravi:
Thresholded covering algorithms for robust and max-min optimization. Math. Program. 146(1-2): 583-615 (2014) - [j19]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): 872-904 (2014) - [j18]Nikhil Bansal, Ravishankar Krishnaswamy, Viswanath Nagarajan:
Better Scalable Algorithms for Broadcast Scheduling. ACM Trans. Algorithms 11(1): 3:1-3:24 (2014) - [c39]Nikhil Bansal, Viswanath Nagarajan:
On the Adaptivity Gap of Stochastic Orienteering. IPCO 2014: 114-125 - [c38]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: 1:1-1:7 - [c37]Antonios Antoniadis, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein:
Hallucination Helps: Energy Efficient Virtual Circuit Routing. SODA 2014: 1141-1153 - [c36]Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein:
Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routing. STOC 2014: 734-743 - [i20]Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein:
Cluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient Routing. CoRR abs/1403.6207 (2014) - [i19]Niv Buchbinder, Shahar Chen, Anupam Gupta, Viswanath Nagarajan, Joseph Naor:
Online Packing and Covering Framework with Convex Objectives. CoRR abs/1412.8347 (2014) - 2013
- [j17]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): 479-506 (2013) - [c35]Anupam Gupta, Satyen Kale, Viswanath Nagarajan, Rishi Saket, Baruch Schieber:
The Approximability of the Binary Paintshop Problem. APPROX-RANDOM 2013: 205-217 - [c34]Maxim A. Babenko, Andrew V. Goldberg, Anupam Gupta, Viswanath Nagarajan:
Algorithms for Hub Label Optimization. ICALP (1) 2013: 69-80 - [c33]Anupam Gupta, Viswanath Nagarajan:
A Stochastic Probing Problem with Applications. IPCO 2013: 205-216 - [c32]Anupam Gupta, Viswanath Nagarajan, Vijay V. Vazirani:
Thrifty Algorithms for Multistage Robust Optimization. IPCO 2013: 217-228 - [c31]Viswanath Nagarajan, Baruch Schieber, Hadas Shachnai:
The Euclidean k-Supplier Problem. IPCO 2013: 290-301 - [c30]Viswanath Nagarajan, Joel L. Wolf, Andrey Balmin, Kirsten Hildrum:
FlowFlex: Malleable Scheduling for Flows of MapReduce Jobs. Middleware 2013: 103-122 - [i18]Anupam Gupta, Viswanath Nagarajan, Vijay V. Vazirani:
Thrifty Algorithms for Multistage Robust Optimization. CoRR abs/1302.5445 (2013) - [i17]Anupam Gupta, Viswanath Nagarajan:
A Stochastic Probing Problem with Applications. CoRR abs/1302.5913 (2013) - [i16]Nikhil Bansal, Viswanath Nagarajan:
On the Adaptivity Gap of Stochastic Orienteering. CoRR abs/1311.3623 (2013) - 2012
- [j16]Nikhil Bansal, Anupam Gupta, Jian Li, Julián Mestre, Viswanath Nagarajan, Atri Rudra:
When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings. Algorithmica 63(4): 733-762 (2012) - [j15]Anupam Gupta, Viswanath Nagarajan, R. Ravi:
Technical Note - Approximation Algorithms for VRP with Stochastic Demands. Oper. Res. 60(1): 123-127 (2012) - [j14]Viswanath Nagarajan, R. Ravi:
Approximation algorithms for distance constrained vehicle routing problems. Networks 59(2): 209-214 (2012) - [j13]Nikhil Bansal, Nitish Korula, Viswanath Nagarajan, Aravind Srinivasan:
Solving Packing Integer Programs via Randomized Rounding with Alterations. Theory Comput. 8(1): 533-565 (2012) - [c29]Inge Li Gørtz, Viswanath Nagarajan, Rishi Saket:
Stochastic Vehicle Routing with Recourse. ICALP (1) 2012: 411-423 - [c28]Anupam Gupta, Viswanath Nagarajan:
Approximating Sparse Covering Integer Programs Online. ICALP (1) 2012: 436-448 - [c27]Sungjin Im, Viswanath Nagarajan, Ruben van der Zwaan:
Minimum Latency Submodular Cover. ICALP (1) 2012: 485-497 - [c26]Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein:
Multicast Routing for Energy Minimization Using Speed Scaling. MedAlg 2012: 37-51 - [c25]Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi:
Approximation algorithms for stochastic orienteering. SODA 2012: 1522-1538 - [i15]Inge Li Gørtz, Viswanath Nagarajan, Rishi Saket:
Stochastic Vehicle Routing with Recourse. CoRR abs/1202.5797 (2012) - [i14]Anupam Gupta, Viswanath Nagarajan:
Approximating Sparse Covering Integer Programs Online. CoRR abs/1205.0175 (2012) - 2011
- [j12]Viswanath Nagarajan, R. Ravi:
The Directed Orienteering Problem. Algorithmica 60(4): 1017-1030 (2011) - [c24]Inge Li Gørtz, Viswanath Nagarajan:
Locating Depots for Capacitated Vehicle Routing. APPROX-RANDOM 2011: 230-241 - [c23]Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz:
Min-max Graph Partitioning and Small Set Expansion. FOCS 2011: 17-26 - [c22]Inge Li Gørtz, Marco Molinaro, Viswanath Nagarajan, R. Ravi:
Capacitated Vehicle Routing with Non-uniform Speeds. IPCO 2011: 235-247 - [c21]Nikhil Bansal, Kang-Won Lee, Viswanath Nagarajan, Murtaza Zafer:
Minimum congestion mapping in a cloud. PODC 2011: 267-276 - [c20]Ravishankar Krishnaswamy, Amit Kumar, Viswanath Nagarajan, Yogish Sabharwal, Barna Saha:
The Matroid Median Problem. SODA 2011: 1117-1130 - [i13]Inge Li Gørtz, Viswanath Nagarajan, R. Ravi:
Minimum Makespan Multi-vehicle Dial-a-Ride. CoRR abs/1102.5450 (2011) - [i12]Inge Li Gørtz, Viswanath Nagarajan:
Locating Depots for Capacitated Vehicle Routing. CoRR abs/1103.0985 (2011) - [i11]Sungjin Im, Viswanath Nagarajan:
Minimum Latency Submodular Cover in Metrics. CoRR abs/1110.2207 (2011) - [i10]Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz:
Min-Max Graph Partitioning and Small Set Expansion. CoRR abs/1110.4319 (2011) - 2010
- [j11]Viswanath Nagarajan, R. Ravi:
Approximation Algorithms for Requirement Cut on Graphs. Algorithmica 56(2): 198-213 (2010) - [j10]Barbara M. Anthony, Vineet Goyal, Anupam Gupta, Viswanath Nagarajan:
A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems. Math. Oper. Res. 35(1): 79-101 (2010) - [j9]Viswanath Nagarajan, R. Ravi, Mohit Singh:
Simpler analysis of LP extreme points for traveling salesman and survivable network design problems. Oper. Res. Lett. 38(3): 156-160 (2010) - [j8]Anupam Gupta, Viswanath Nagarajan, R. Ravi:
An improved approximation algorithm for requirement cut. Oper. Res. Lett. 38(4): 322-325 (2010) - [j7]Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko:
Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints. SIAM J. Discret. Math. 23(4): 2053-2078 (2010) - [j6]Anupam Gupta, Mohammad Taghi Hajiaghayi, Viswanath Nagarajan, R. Ravi:
Dial a Ride from k-forest. ACM Trans. Algorithms 6(2): 41:1-41:21 (2010) - [c19]Nikhil Bansal, Anupam Gupta, Jian Li, Julián Mestre, Viswanath Nagarajan, Atri Rudra:
When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings - (Extended Abstract). ESA (2) 2010: 218-229 - [c18]Anupam Gupta, Viswanath Nagarajan, R. Ravi:
Thresholded Covering Algorithms for Robust and Max-min Optimization. ICALP (1) 2010: 262-274 - [c17]Nikhil Bansal, Ravishankar Krishnaswamy, Viswanath Nagarajan:
Better Scalable Algorithms for Broadcast Scheduling. ICALP (1) 2010: 324-335 - [c16]Anupam Gupta, Viswanath Nagarajan, R. Ravi:
Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems. ICALP (1) 2010: 690-701 - [c15]Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis:
On Generalizations of Network Design Problems with Degree Bounds. IPCO 2010: 110-123 - [c14]Nikhil Bansal, Nitish Korula, Viswanath Nagarajan, Aravind Srinivasan:
On k-Column Sparse Packing Programs. IPCO 2010: 369-382 - [i9]Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi:
Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems. CoRR abs/1003.0722 (2010) - [i8]Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis:
On Generalizations of Network Design Problems with Degree Bounds. CoRR abs/1003.2977 (2010) - [i7]Nikhil Bansal, Anupam Gupta, Jian Li, Julián Mestre, Viswanath Nagarajan, Atri Rudra:
When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings. CoRR abs/1008.5356 (2010) - [i6]Inge Li Gørtz, Marco Molinaro, Viswanath Nagarajan, R. Ravi:
Capacitated Vehicle Routing with Non-Uniform Speeds. CoRR abs/1012.1850 (2010) - [i5]Anupam Gupta, Viswanath Nagarajan, R. Ravi:
Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets. CoRR abs/1012.4962 (2010)
2000 – 2009
- 2009
- [j5]Viswanath Nagarajan, Maxim Sviridenko:
Tight Bounds for Permutation Flow Shop Scheduling. Math. Oper. Res. 34(2): 417-427 (2009) - [j4]Viswanath Nagarajan, Maxim Sviridenko:
On the Maximum Quadratic Assignment Problem. Math. Oper. Res. 34(4): 859-868 (2009) - [j3]Nikhil Bansal, Rohit Khandekar, Viswanath Nagarajan:
Additive Guarantees for Degree-Bounded Directed Network Design. SIAM J. Comput. 39(4): 1413-1431 (2009) - [c13]Inge Li Gørtz, Viswanath Nagarajan, R. Ravi:
Minimum Makespan Multi-vehicle Dial-a-Ride. ESA 2009: 540-552 - [c12]Viswanath Nagarajan, Maxim Sviridenko:
On the maximum quadratic assignment problem. SODA 2009: 516-524 - [c11]Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko:
Non-monotone submodular maximization under matroid and knapsack constraints. STOC 2009: 323-332 - [i4]Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko:
Non-monotone submodular maximization under matroid and knapsack constraints. CoRR abs/0902.0353 (2009) - [i3]Nikhil Bansal, Nitish Korula, Viswanath Nagarajan:
On k-Column Sparse Packing Programs. CoRR abs/0908.2256 (2009) - [i2]Anupam Gupta, Viswanath Nagarajan, R. Ravi:
Thresholded Covering Algorithms for Robust and Max-Min Optimization. CoRR abs/0912.1045 (2009) - 2008
- [j2]Viswanath Nagarajan, Abhiram G. Ranade:
Exact train pathing. J. Sched. 11(4): 279-297 (2008) - [j1]Viswanath Nagarajan:
On the LP Relaxation of the Asymmetric Traveling Salesman Path Problem. Theory Comput. 4(1): 191-193 (2008) - [c10]Viswanath Nagarajan, R. Ravi:
The Directed Minimum Latency Problem. APPROX-RANDOM 2008: 193-206 - [c9]Viswanath Nagarajan, Maxim Sviridenko:
Tight Bounds for Permutation Flow Shop Scheduling. IPCO 2008: 154-168 - [c8]Barbara M. Anthony, Vineet Goyal, Anupam Gupta, Viswanath Nagarajan:
A plant location guide for the unsure. SODA 2008: 1164-1173 - [c7]Nikhil Bansal, Rohit Khandekar, Viswanath Nagarajan:
Additive guarantees for degree bounded directed network design. STOC 2008: 769-778 - 2007
- [c6]Viswanath Nagarajan, R. Ravi:
Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems. APPROX-RANDOM 2007: 257-270 - [c5]Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi:
Dial a Ride from k -Forest. ESA 2007: 241-252 - [i1]Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi:
Dial a Ride from k-forest. CoRR abs/0707.0648 (2007) - 2006
- [c4]Viswanath Nagarajan, R. Ravi:
Minimum Vehicle Routing with a Common Deadline. APPROX-RANDOM 2006: 212-223 - [c3]Daniel Golovin, Viswanath Nagarajan, Mohit Singh:
Approximating the k-multicut problem. SODA 2006: 621-630 - 2005
- [c2]Viswanath Nagarajan, R. Ravi:
Approximation Algorithms for Requirement Cut on Graphs. APPROX-RANDOM 2005: 209-220 - [c1]Deeparnab Chakrabarty, Aranyak Mehta, Viswanath Nagarajan:
Fairness and optimality in congestion games. EC 2005: 52-57
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-27 22:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
