Nagarajan Viswanath

Viswanath Nagarajan

Information about the author Viswanath Nagarajan will soon be added to the site.
Found 6 papers in total
Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems
Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems
2017
We consider the problem of constructing optimal decision trees: given a collection of...
Locating depots for capacitated vehicle routing
Locating depots for capacitated vehicle routing
2016
We study a location‐routing problem in the context of capacitated vehicle...
When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings
When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings
2012
Consider a random graph model where each possible edge e is present independently with...
The Directed Orienteering Problem
The Directed Orienteering Problem
2011
This paper studies vehicle routing problems on asymmetric metrics. Our starting point...
A plant location guide for the unsure: Approximation algorithms for min-max location problems
A plant location guide for the unsure: Approximation algorithms for min-max location problems
2010
This paper studies an extension of the k -median problem under uncertain demand. We...
Tight bounds for permutation flow shop scheduling
Tight bounds for permutation flow shop scheduling
2009
In flow shop scheduling there are m machines and n jobs, such that every job has to be...
Papers per page: