The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Viswanath Nagarajan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Viswanath Nagarajan, R. Ravi
    Approximation Algorithms for Requirement Cut on Graphs. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2005, pp:209-220 [Conf]
  2. Viswanath Nagarajan, R. Ravi
    Minimum Vehicle Routing with a Common Deadline. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:212-223 [Conf]
  3. 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]
  4. Daniel Golovin, Viswanath Nagarajan, Mohit Singh
    Approximating the k-multicut problem. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:621-630 [Conf]
  5. 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]
  6. 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]
  7. 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]

  8. The Directed Minimum Latency Problem. [Citation Graph (, )][DBLP]


  9. Minimum Makespan Multi-vehicle Dial-a-Ride. [Citation Graph (, )][DBLP]


  10. When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings - (Extended Abstract). [Citation Graph (, )][DBLP]


  11. Thresholded Covering Algorithms for Robust and Max-min Optimization. [Citation Graph (, )][DBLP]


  12. Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems. [Citation Graph (, )][DBLP]


  13. Better Scalable Algorithms for Broadcast Scheduling. [Citation Graph (, )][DBLP]


  14. On k-Column Sparse Packing Programs. [Citation Graph (, )][DBLP]


  15. Tight Bounds for Permutation Flow Shop Scheduling. [Citation Graph (, )][DBLP]


  16. On Generalizations of Network Design Problems with Degree Bounds. [Citation Graph (, )][DBLP]


  17. A plant location guide for the unsure. [Citation Graph (, )][DBLP]


  18. On the maximum quadratic assignment problem. [Citation Graph (, )][DBLP]


  19. Additive guarantees for degree bounded directed network design. [Citation Graph (, )][DBLP]


  20. Non-monotone submodular maximization under matroid and knapsack constraints. [Citation Graph (, )][DBLP]


  21. Approximation Algorithms for Requirement Cut on Graphs. [Citation Graph (, )][DBLP]


  22. Non-monotone submodular maximization under matroid and knapsack constraints [Citation Graph (, )][DBLP]


  23. On k-Column Sparse Packing Programs [Citation Graph (, )][DBLP]


  24. Thresholded Covering Algorithms for Robust and Max-Min Optimization [Citation Graph (, )][DBLP]


  25. When LP is the Cure for Your Matching Woes: Approximating Stochastic Matchings [Citation Graph (, )][DBLP]


  26. Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems [Citation Graph (, )][DBLP]


  27. On Generalizations of Network Design Problems with Degree Bounds [Citation Graph (, )][DBLP]


  28. 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
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002