Conference Ordering problems approximated: Single-processor scheduling and interval graph completion 1991 • Lecture Notes in Computer Science • 510 LNCS:751-762 Ravi R, Agrawal A, Klein P
Conference When trees collide: an approximation algorithm for the generalized Steiner problem on networks 1991 134-144 Agrawal A, Klein P, Ravi R
Conference Approximation through multicommodity flow 1990 • Annual Symposium on Foundations of Computer Science • 2:726-737 Klein P, Agrawal A, Ravi R, Rao S
Journal Article Informed Steiner Trees: Sampling and Pruning for Multi-Goal Path Finding in High Dimensions (Extended Abstract) • Proceedings of the International Symposium on Combinatorial Search • 15(1):258-260 Chandak N, Chour K, Rathinam S, Ravi R
Journal Article S*: A Heuristic Information-Based Approximation Framework for Multi-Goal Path Finding • Proceedings International Conference on Automated Planning and Scheduling, ICAPS • 31:85-93 Chour K, Rathinam S, Ravi R
