|
Search the dblp DataBase
Viswanath Nagarajan:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Viswanath Nagarajan, R. Ravi
Approximation Algorithms for Requirement Cut on Graphs. [Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2005, pp:209-220 [Conf]
- Viswanath Nagarajan, R. Ravi
Minimum Vehicle Routing with a Common Deadline. [Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2006, pp:212-223 [Conf]
- Deeparnab Chakrabarty, Aranyak Mehta, Viswanath Nagarajan
Fairness and optimality in congestion games. [Citation Graph (0, 0)][DBLP] ACM Conference on Electronic Commerce, 2005, pp:52-57 [Conf]
- Daniel Golovin, Viswanath Nagarajan, Mohit Singh
Approximating the k-multicut problem. [Citation Graph (0, 0)][DBLP] SODA, 2006, pp:621-630 [Conf]
- Viswanath Nagarajan, R. Ravi
Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems. [Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2007, pp:257-270 [Conf]
- Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi
Dial a Ride from k -Forest. [Citation Graph (0, 0)][DBLP] ESA, 2007, pp:241-252 [Conf]
- Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi
Dial a Ride from k-forest [Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal]
The Directed Minimum Latency Problem. [Citation Graph (, )][DBLP]
Minimum Makespan Multi-vehicle Dial-a-Ride. [Citation Graph (, )][DBLP]
When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings - (Extended Abstract). [Citation Graph (, )][DBLP]
Thresholded Covering Algorithms for Robust and Max-min Optimization. [Citation Graph (, )][DBLP]
Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems. [Citation Graph (, )][DBLP]
Better Scalable Algorithms for Broadcast Scheduling. [Citation Graph (, )][DBLP]
On k-Column Sparse Packing Programs. [Citation Graph (, )][DBLP]
Tight Bounds for Permutation Flow Shop Scheduling. [Citation Graph (, )][DBLP]
On Generalizations of Network Design Problems with Degree Bounds. [Citation Graph (, )][DBLP]
A plant location guide for the unsure. [Citation Graph (, )][DBLP]
On the maximum quadratic assignment problem. [Citation Graph (, )][DBLP]
Additive guarantees for degree bounded directed network design. [Citation Graph (, )][DBLP]
Non-monotone submodular maximization under matroid and knapsack constraints. [Citation Graph (, )][DBLP]
Approximation Algorithms for Requirement Cut on Graphs. [Citation Graph (, )][DBLP]
Non-monotone submodular maximization under matroid and knapsack constraints [Citation Graph (, )][DBLP]
On k-Column Sparse Packing Programs [Citation Graph (, )][DBLP]
Thresholded Covering Algorithms for Robust and Max-Min Optimization [Citation Graph (, )][DBLP]
When LP is the Cure for Your Matching Woes: Approximating Stochastic Matchings [Citation Graph (, )][DBLP]
Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems [Citation Graph (, )][DBLP]
On Generalizations of Network Design Problems with Degree Bounds [Citation Graph (, )][DBLP]
When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs
|