Abstract: In undirected graphs with real non-negative weights, we give a new randomized algorithm for the single-source shortest path (SSSP) problem with running time ...

Abstract: We present a novel algorithm to solve the nonnegative single-source shortest path problem on road networks and other graphs with low highway dimension. After a quick preprocessing phase, we ...

We introduce the heat method for solving the single- or multiple-source shortest path problem on both flat and curved domains. A key insight is that distance computation can be split into two stages: ...

Jeremiah Blocki, jblocki+451@cs.cmu.edu: Monday @ 3:30 PM. GHC 7th floor lounge. Students can email me if they want to meet at a different time. Anvesh Komuravelli, anvesh+451@cs.cmu.edu: Friday @ 4 ...

There was an error while loading. Please reload this page.

The traveling salesman problem (TSP) asks the question, "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city and returns to ...

Google Maps taking you the long way? Learn why the app defaults to slower routes and discover the hidden settings that will ...

When a fire alarm sounds, most people instinctively head toward the nearest exit. The problem is that the closest route is ...

Researchers have finally resolved a key problem in a 100-year-old theory of color, showing that the qualities we perceive in colors are intrinsic to the mathematics of color space itself. The ...

D-Wave is something of an anomaly in a quantum computing industry. While companies ranging from hyperscalers like Microsoft, Google, and Amazon Web Services to traditional enterprise system makers ...

Alphabet X spinout Taara uses eye-safe lasers to send fiber-class data through the air, deploying in hours to speed AI data center buildouts.

Today:Early fog in the far southwest clears quickly. Most areas stay dry with sunshine and variable cloud, though northern and northeastern regions may see isolated showers. Light winds overall, ...