Information about the author Viswanath Nagarajan will soon be added to the site.
Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems
We consider the problem of constructing optimal decision trees: given a collection of...
Locating depots for capacitated vehicle routing
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
Consider a random graph model where each possible edge e is present independently with...
The Directed Orienteering Problem
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
This paper studies an extension of the k -median problem under uncertain demand. We...
Tight bounds for permutation flow shop scheduling
In flow shop scheduling there are m machines and n jobs, such that every job has to be...
Papers per page: