# Ola Svensson > Ph.D. Università di Lugano 2009 **Wikidata**: [Q102402888](https://www.wikidata.org/wiki/Q102402888) **Source**: https://4ort.xyz/entity/ola-svensson-q102402888 ## Summary Ola Svensson is a computer scientist known for his significant contributions to combinatorial optimization and graph-theoretic algorithms. He serves as a researcher at the Swiss Federal Institute of Technology in Lausanne (EPFL). In 2018, he was awarded the Michael and Sheila Held Prize for developing the first constant factor approximation algorithm for the asymmetric traveling salesman problem. ## Biography - **Education:** Ph.D., Dalle Molle Institute for Artificial Intelligence Research (Università di Lugano), 2009 - **Known for:** Combinatorial optimization, graph-theoretic algorithms, and the asymmetric traveling salesman problem - **Employer(s):** Swiss Federal Institute of Technology in Lausanne (starting August 1, 2012) - **Field(s):** Computer Science - **Doctoral Advisor:** Monaldo Mastrolilli - **Doctoral Students:** Andrea Baggio ## Contributions Ola Svensson has made distinct contributions to the field of theoretical computer science, particularly within combinatorial optimization. His most impactful work culminated in the development of the first constant factor approximation algorithm for the asymmetric traveling salesman problem (ATSP). This breakthrough addressed a long-standing challenge in the field regarding how to efficiently approximate optimal routes in graphs where distances may differ depending on direction. His achievement in solving the ATSP approximation problem was specifically cited when he received the Michael and Sheila Held Prize in 2018. The National Academy of Sciences recognized this work as a major advancement in graph-theoretic algorithms. Svensson's academic background includes a Ph.D. obtained in 2009 from the Dalle Molle Institute for Artificial Intelligence Research (IDSIA) at Università di Lugano. His academic lineage includes mentorship by Monaldo Mastrolilli at IDSIA. He has since continued his academic career at the Swiss Federal Institute of Technology in Lausanne (EPFL), where he began his tenure in August 2012. At EPFL, he has supervised doctoral candidates such as Andrea Baggio, contributing to the next generation of research in the field. His professional footprint is tracked across various academic databases, including DBLP, IEEE Xplore, and the Mathematics Genealogy Project. ## FAQs ### Q: What is Ola Svensson best known for in computer science? A: He is best known for his breakthroughs in combinatorial optimization, specifically for creating the first constant factor approximation algorithm for the asymmetric traveling salesman problem. ### Q: What major award did Ola Svensson receive? A: Ola Svensson received the Michael and Sheila Held Prize in 2018 for his contributions to graph-theoretic algorithms and combinatorial optimization. ### Q: Where did Ola Svensson complete his Ph.D.? A: He completed his Ph.D. in 2009 at the Dalle Molle Institute for Artificial Intelligence Research (affiliated with Università di Lugano) under advisor Monaldo Mastrolilli. ### Q: Where does Ola Svensson work? A: He is affiliated with the Swiss Federal Institute of Technology in Lausanne (EPFL), having started his position there on August 1, 2012. ## Why They Matter Ola Svensson matters to the field of computer science because he resolved a critical theoretical gap in the asymmetric traveling salesman problem (ATSP). The ATSP is a fundamental problem in operations research and computer science, dealing with finding the shortest path through a network where the cost of travel between two points may not be the same in both directions. For years, finding a constant factor approximation—a way to guarantee a solution within a certain multiple of the optimal—remained an open question. Svensson's work provided the first such algorithm, fundamentally advancing the mathematical toolkit available for complex routing and logistics problems. His research has shifted the baseline for what is considered achievable in approximation algorithms. Furthermore, his role at the Swiss Federal Institute of Technology in Lausanne (EPFL) and his previous work at the Dalle Molle Institute for Artificial Intelligence Research position him as a key node in the network of European theoretical computer science. Through his research and mentorship of students like Andrea Baggio, he continues to influence the study of algorithmic efficiency and optimization. ## Notable For - Receiving the **Michael and Sheila Held Prize** in 2018. - Developing the **first constant factor approximation algorithm** for the asymmetric traveling salesman problem. - Earning a Ph.D. from the **Dalle Molle Institute for Artificial Intelligence Research** (IDSIA). - Serving as a researcher at the **Swiss Federal Institute of Technology in Lausanne** (EPFL). - Being listed in the **Mathematics Genealogy Project** (ID: 168233) and **DBLP** (ID: 11/6945). ## Body ### Educational Background Ola Svensson pursued his doctoral studies at the Dalle Molle Institute for Artificial Intelligence Research (IDSIA), a Swiss public research institute established in 1988. He completed his Ph.D. at Università di Lugano in 2009. His dissertation work was supervised by Monaldo Mastrolilli, a professor and computer scientist also affiliated with SUPSI. ### Research and Career Svensson is a computer scientist recognized for his expertise in combinatorial optimization and graph-theoretic algorithms. His professional career includes a significant tenure at the Swiss Federal Institute of Technology in Lausanne (EPFL), which began on August 1, 2012. His research ID is tracked by the SNSF (Swiss National Science Foundation) as person ID 527115. In his capacity as a researcher and advisor, he has mentored doctoral students, including Andrea Baggio. His academic peers and publications are indexed under several identifiers, ensuring his contributions are accessible via IEEE Xplore (ID: 37867716400) and MR Author ID (809867). ### Awards and Recognition In 2018, Svensson was awarded the Michael and Sheila Held Prize. The award citation specifically noted his "breakthroughs in combinatorial optimization and graph-theoretic algorithms culminating in the first constant factor approximation algorithm for the asymmetric traveling salesman problem." This prize recognizes outstanding, innovative, creative, and influential research in the areas of combinatorial and discrete optimization, as well as algorithm design and analysis. ## References 1. [Source](https://theory.epfl.ch/osven/) 2. [Source](https://www.nasonline.org/programs/awards/michael-and-sheila-held-prize.html) 3. Mathematics Genealogy Project