Searching for authors named "Viswanath Nagarajan" – sorted by Relevance.
-
Approximation algorithms for requirement cut on graphs
- Approximation Algorithms for Requirement cut on graphs Viswanath Nagarajan ∗ R. Ravi † Tepper
- Cited by 1 (1 self) – Add To MetaCart
-
Minimum vehicle routing with a common deadline
- Minimum Vehicle Routing with a Common Deadline Viswanath Nagarajan ⋆ and R. Ravi ⋆⋆ Tepper School
- Cited by 1 (0 self) – Add To MetaCart
-
The Directed Minimum Latency Problem
- The Directed Minimum Latency Problem Viswanath Nagarajan ∗ R. Ravi ∗ Abstract We study
- Add To MetaCart
-
Poly-logarithmic approximation algorithms for Directed Vehicle Routing Problems
- Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems Viswanath
- Cited by 4 (1 self) – Add To MetaCart
-
Abstract On the Maximum Quadratic Assignment Problem
- Abstract On the Maximum Quadratic Assignment Problem Viswanath Nagarajan ∗ Maxim Sviridenko
- Add To MetaCart
-
Dial a ride from k-Forest
- Taghi Hajiaghayi † Viswanath Nagarajan ‡ R. Ravi ‡ July 4, 2007 Abstract The k-forest problem is a common
- Cited by 1 (0 self) – Add To MetaCart
-
Approximating the k-multicut problem
- Approximating the k-Multicut Problem Daniel Golovin ∗ Viswanath Nagarajan † Mohit Singh ‡ October
- Cited by 7 (0 self) – Add To MetaCart
-
unknown title
- Exact Train Pathing Viswanath Nagarajan ∗ Abhiram G. Ranade † Abstract Suppose we are given a
- Add To MetaCart
-
Lecture 6: Facility location: greedy and local search algorithms 31-Jan-08
- and local search algorithms 31-Jan-08 Lecturer: Anupam Gupta Scribe: Viswanath Nagarajan 1 A modified greedy
- Add To MetaCart
-
A plant location guide for the unsure
- A Plant Location Guide for the Unsure Barbara M. Anthony ∗ Vineet Goyal † Anupam Gupta ‡ Viswanath
- Cited by 1 (1 self) – Add To MetaCart

