Shayan Oveis Gharan finds the shortest route to success | Science News

SUPPORT SCIENCE NEWS

Science News is a nonprofit.

Help us keep you informed.


Feature

Shayan Oveis Gharan finds the shortest route to success

Broad mathematical toolkit had led to key advances in the traveling salesman problem

By
11:04am, September 21, 2016
Shayan Oveis Gharan

Theoretical computer scientist Shayan Oveis Gharan has identified connections between unrelated fields to tackle the traveling salesman problem.

Shayan Oveis Gharan, 30
Theoretical computer scientist
University of Washington

It’s a problem that sounds simple, but the best minds in mathematics have puzzled over it for generations: A salesman wants to hawk his wares in several cities and return home when he’s done. If he’s only visiting a handful of places, it’s easy for him to schedule his visits to create the shortest round-trip route. But the task rapidly becomes unwieldy as the number of destinations increases, ballooning the number of possible routes.

Theoretical computer scientist Shayan Oveis Gharan, an assistant professor at the University of Washington in Seattle, has made

This article is only available to Science News subscribers. Already a subscriber? Log in now. Or subscribe today for full access.

Get Science News headlines by e-mail.

More from Science News

From the Nature Index Paid Content