Viswanath Nagarajan

Orcid: 0000-0002-9514-5581

Affiliations:
  • University of Michigan, Ann Arbor, USA


According to our database1, Viswanath Nagarajan authored at least 102 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Cluster Before You Hallucinate: Node-Capacitated Network Design and Energy Efficient Routing.
SIAM J. Comput., 2024

Online Generalized Network Design Under (Dis)Economies of Scale.
Math. Oper. Res., 2024

The Power of Adaptivity for Stochastic Submodular Cover.
Oper. Res., 2024

Lower Bound on the Greedy Approximation Ratio for Adaptive Submodular Cover.
CoRR, 2024

Informative Path Planning with Limited Adaptivity.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023
Efficient Algorithms for Stochastic Ride-Pooling Assignment with Mixed Fleets.
Transp. Sci., July, 2023

Semi-Bandit Learning for Monotone Stochastic Optimization.
CoRR, 2023

Minimum Cost Adaptive Submodular Cover.
Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

2022
On some variants of Euclidean k-supplier.
Oper. Res. Lett., 2022

Stochastic makespan minimization in structured set systems.
Math. Program., 2022

Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems.
Math. Oper. Res., 2022

Constrained Assortment Optimization Under the Paired Combinatorial Logit Model.
Oper. Res., 2022

Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization.
INFORMS J. Comput., 2022

An Asymptotically Optimal Batched Algorithm for the Dueling Bandit Problem.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Non-adaptive Stochastic Score Classification and Explainable Halfspace Evaluation.
Proceedings of the Integer Programming and Combinatorial Optimization, 2022

Batched Dueling Bandits.
Proceedings of the International Conference on Machine Learning, 2022

2021
Stochastic Load Balancing on Unrelated Machines.
Math. Oper. Res., 2021

Efficient Algorithms for Stochastic Ridepooling Assignment with Mixed Fleets.
CoRR, 2021

2020
Hallucination Helps: Energy Efficient Virtual Circuit Routing.
SIAM J. Comput., 2020

Approximation algorithms for the a priori traveling repairman.
Oper. Res. Lett., 2020

Online covering with ℓ <sub>q</sub>-norm objectives and applications to network design.
Math. Program., 2020

The Euclidean <i>k</i>-Supplier Problem.
Math. Oper. Res., 2020

Adaptive Submodular Ranking and Routing.
Oper. Res., 2020

Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Other Directed Network Design Problems.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Stochastic Makespan Minimization in Structured Set Systems (Extended Abstract).
Proceedings of the Integer Programming and Combinatorial Optimization, 2020

2019
Malleable scheduling for flows of jobs and applications to MapReduce.
J. Sched., 2019

Approximation Algorithms for the A Priori TravelingRepairman.
CoRR, 2019

Optimal Decision Tree with Noisy Outcomes.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

2018
An approximation algorithm for vehicle routing with compatibility constraints.
Oper. Res. Lett., 2018

Approximating max-cut under graph-MSO constraints.
Oper. Res. Lett., 2018

Approximating graph-constrained max-cut.
Math. Program., 2018

A Quasi-Polynomial Algorithm for Submodular Tree Orienteering in Directed Graphs.
CoRR, 2018

2017
Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems.
Math. Oper. Res., 2017

Adaptivity Gaps for Stochastic Probing: Submodular and XOS Functions.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Adaptive Submodular Ranking.
Proceedings of the Integer Programming and Combinatorial Optimization, 2017

Online Covering with Sum of $ell_q$-Norm Objectives.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Approximation Algorithms for Stochastic k-TSP.
Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

Minimum Makespan Vehicle Routing Problem with Compatibility Constraints.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2017

2016
Stochastic Knapsack.
Encyclopedia of Algorithms, 2016

Minimum Latency Submodular Cover.
ACM Trans. Algorithms, 2016

Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets.
ACM Trans. Algorithms, 2016

Algorithms for Hub Label Optimization.
ACM Trans. Algorithms, 2016

Locating depots for capacitated vehicle routing.
Networks, 2016

Approximation algorithms for inventory problems with submodular or routing costs.
Math. Program., 2016

Capacitated Vehicle Routing with Nonuniform Speeds.
Math. Oper. Res., 2016

Algorithms and Adaptivity Gaps for Stochastic Probing.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Max-Cut Under Graph Constraints.
Proceedings of the Integer Programming and Combinatorial Optimization, 2016

Approximation-Friendly Discrepancy Rounding.
Proceedings of the Integer Programming and Combinatorial Optimization, 2016

Online Algorithms for Covering and Packing Problems with Convex Objectives.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015
Minimum Makespan Multi-Vehicle Dial-a-Ride.
ACM Trans. Algorithms, 2015

Minimum Congestion Mapping in a Cloud.
SIAM J. Comput., 2015

On the adaptivity gap of stochastic orienteering.
Math. Program., 2015

Facility Location with Matroid or Knapsack Constraints.
Math. Oper. Res., 2015

Running Errands in Time: Approximation Algorithms for Stochastic Orienteering.
Math. Oper. Res., 2015

The Container Selection Problem.
Proceedings of the Approximation, 2015

2014
Better Scalable Algorithms for Broadcast Scheduling.
ACM Trans. Algorithms, 2014

Min-Max Graph Partitioning and Small Set Expansion.
SIAM J. Comput., 2014

Thresholded covering algorithms for robust and max-min optimization.
Math. Program., 2014

Approximating Sparse Covering Integer Programs Online.
Math. Oper. Res., 2014

Online Packing and Covering Framework with Convex Objectives.
CoRR, 2014

Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routing.
Proceedings of the Symposium on Theory of Computing, 2014

The X-flex cross-platform scheduler: who's the fairest of them all?
Proceedings of the Middleware Industry Track, Bordeaux, France, December 8-12, 2014, 2014

2013
On generalizations of network design problems with degree bounds.
Math. Program., 2013

FlowFlex: Malleable Scheduling for Flows of MapReduce Jobs.
Proceedings of the Middleware 2013, 2013

The Euclidean k-Supplier Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2013

Thrifty Algorithms for Multistage Robust Optimization.
Proceedings of the Integer Programming and Combinatorial Optimization, 2013

A Stochastic Probing Problem with Applications.
Proceedings of the Integer Programming and Combinatorial Optimization, 2013

The Approximability of the Binary Paintshop Problem.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012
Solving Packing Integer Programs via Randomized Rounding with Alterations.
Theory Comput., 2012

Approximation algorithms for distance constrained vehicle routing problems.
Networks, 2012

Technical Note - Approximation Algorithms for VRP with Stochastic Demands.
Oper. Res., 2012

When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings.
Algorithmica, 2012

Approximation algorithms for stochastic orienteering.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Multicast Routing for Energy Minimization Using Speed Scaling.
Proceedings of the Design and Analysis of Algorithms, 2012

Stochastic Vehicle Routing with Recourse.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011
Minimum Latency Submodular Cover in Metrics
CoRR, 2011

The Directed Orienteering Problem.
Algorithmica, 2011

The Matroid Median Problem.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Capacitated Vehicle Routing with Non-uniform Speeds.
Proceedings of the Integer Programming and Combinatoral Optimization, 2011

2010
Dial a Ride from <i>k</i>-forest.
ACM Trans. Algorithms, 2010

Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints.
SIAM J. Discret. Math., 2010

Simpler analysis of LP extreme points for traveling salesman and survivable network design problems.
Oper. Res. Lett., 2010

An improved approximation algorithm for requirement cut.
Oper. Res. Lett., 2010

A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems.
Math. Oper. Res., 2010

Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems
CoRR, 2010

Approximation Algorithms for Requirement Cut on Graphs.
Algorithmica, 2010

On <i>k</i>-Column Sparse Packing Programs.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010

When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings - (Extended Abstract).
Proceedings of the Algorithms, 2010

2009
Additive Guarantees for Degree-Bounded Directed Network Design.
SIAM J. Comput., 2009

On the Maximum Quadratic Assignment Problem.
Math. Oper. Res., 2009

Tight Bounds for Permutation Flow Shop Scheduling.
Math. Oper. Res., 2009

On k-Column Sparse Packing Programs
CoRR, 2009

Non-monotone submodular maximization under matroid and knapsack constraints.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

2008
On the LP Relaxation of the Asymmetric Traveling Salesman Path Problem.
Theory Comput., 2008

Exact train pathing.
J. Sched., 2008

A plant location guide for the unsure.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

The Directed Minimum Latency Problem.
Proceedings of the Approximation, 2008

2007
Dial a Ride from k-forest
CoRR, 2007

Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems.
Proceedings of the Approximation, 2007

2006
Approximating the <i>k</i>-multicut problem.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Minimum Vehicle Routing with a Common Deadline.
Proceedings of the Approximation, 2006

2005
Fairness and optimality in congestion games.
Proceedings of the Proceedings 6th ACM Conference on Electronic Commerce (EC-2005), 2005


  Loading...