Prasad Chalasani

Papers

Total Citations

143

H-Index

About

Prasad Chalasani is a computer scientist whose research spans combinatorial optimization, approximation algorithms, and autonomous robot navigation. His most influential contribution lies in the domain of vehicle routing, where his 1999 paper on capacitated routing and delivery problems has garnered over 100 citations and remains a foundational reference in the field. In that work, Chalasani developed approximation algorithms for a generalized k-delivery Traveling Salesman Problem, addressing the challenge of efficiently routing vehicles with capacity constraints across metric spaces — a problem with broad practical applications in logistics and operations research. Beyond combinatorial optimization, Chalasani has also contributed to the study of online algorithms for robot navigation in unknown geometric environments. His work in this area investigates how a robot can leverage partial knowledge gained from prior traversals to improve the efficiency of subsequent trips between two points, advancing the theoretical understanding of adaptive navigation strategies. Though his publication record is focused, the sustained citation impact of his routing work reflects its lasting relevance to researchers in theoretical computer science, operations research, and algorithmic robotics. His contributions offer both rigorous theoretical guarantees and practical insights for real-world optimization challenges.