C
Chris Harrelson
Researcher at University of California, Berkeley
Publications - 10
Citations - 1543
Chris Harrelson is an academic researcher from University of California, Berkeley. The author has contributed to research in topics: Approximation algorithm & Travelling salesman problem. The author has an hindex of 8, co-authored 10 publications receiving 1465 citations. Previous affiliations of Chris Harrelson include Google.
Papers
More filters
Proceedings ArticleDOI
Computing the shortest path: A search meets graph theory
TL;DR: Experimental results show that the most efficient of the new shortest path algorithms outperforms previous algorithms, in particular A* search with Euclidean bounds, by a wide margin on road networks and on some synthetic problem families.
Book ChapterDOI
Fast routing in very large public transportation networks using transfer patterns
Hannah Bast,Erik Carlsson,Arno Eigenwillig,Robert Geisberger,Chris Harrelson,Veselin Raychev,Fabien Viger +6 more
TL;DR: This work shows how to route on very large public transportation networks (up to half a billion arcs) with average query times of a few milliseconds, based on two key observations: many shortest paths share the same transfer pattern and direct connections without change of vehicle can be looked up quickly.
Proceedings ArticleDOI
A polynomial-time tree decomposition to minimize congestion
TL;DR: How to compute a hierarchical decomposition and a corresponding oblivious routing strategy in polynomial time is shown and the decomposition gives an improved competitive ratio for congestion of O(log2 n log log n).
Patent
Transit routing system for public transportation trip planning
Hannah Bast,Erik Carlsson,Arno Eigenwillig,Robert Geisberger,Chris Harrelson,Veselin Raychev,Fabien Viger +6 more
TL;DR: In this article, a public transit travel planning system and methodology that uses an extensive pre-processing approach of transit information prior to query time on order to determine optimal public transit routes for journeys.
Proceedings ArticleDOI
The k-traveling repairman problem
TL;DR: An 8.497α-approximation algorithm is given for this generalization of the metric traveling repairman problem, also known as the minimum latency problem, to multiple repairmen, where α denotes the best achievable approximation factor for the problem of finding the least cost rooted tree spanning i vertices (i-MST) problem.