Chris Harrelson

According to our database, Chris Harrelson authored at least 9 papers between 2001 and 2010.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2010

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

Proceedings of the Algorithms, 2010

2007

The <i>k</i>-traveling repairmen problem.

Jittat Fakcharoenphol, Chris Harrelson, Satish Rao

ACM Trans. Algorithms, 2007

2005

Computing the shortest path: <i>A</i> search meets graph theory.

Andrew V. Goldberg, Chris Harrelson

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Lower Bounds for Maximum Parsimony with Gene Order Data.

Abraham Bachrach, Kevin C. Chen, Chris Harrelson, Radu Mihaescu, Satish Rao, Apurva Shah

Proceedings of the Comparative Genomics, 2005

2004

Approximate classification via earthmover metrics.

Aaron Archer, Jittat Fakcharoenphol, Chris Harrelson, Robert Krauthgamer, Kunal Talwar, Éva Tardos

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003

A polynomial-time tree decomposition to minimize congestion.

Chris Harrelson, Kirsten Hildrum, Satish Rao

Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

An improved approximation algorithm for the 0-extension problem.

Jittat Fakcharoenphol, Chris Harrelson, Satish Rao, Kunal Talwar

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

The k-traveling repairman problem.

Jittat Fakcharoenphol, Chris Harrelson, Satish Rao

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2001

Quantum Clock Synchronization with one qubit

Chris Harrelson, Iordanis Kerenidis

CoRR, 2001