Esteban Feuerstein

Papers

Total Citations

170

H-Index

About

Esteban Feuerstein is a leading figure in theoretical computer science, best known for his pioneering work in online algorithms and combinatorial optimization. His most significant contribution is the formalization and analysis of the On-Line Travelling Salesman Problem (OLTSP), which addresses the challenge of efficiently serving a sequence of requests that arrive in real-time across a metric space. This foundational work, published in a highly cited 2001 paper (167 citations), has had a profound impact on logistics, robotics, and dynamic routing, providing a rigorous framework for decision-making under uncertainty. Feuerstein’s research extends to approximation algorithms, computational geometry, and the design of competitive online strategies. His insights into how to balance immediate decisions with long-term performance have influenced both theoretical advances and practical applications in areas like delivery scheduling and autonomous vehicle navigation. With a career dedicated to solving complex, real-world problems through elegant algorithmic design, Feuerstein remains a key reference for students and researchers exploring the intersection of theory and application in dynamic environments.