#### Filter Results:

- Full text PDF available (8)

#### Publication Year

2000

2010

- This year (0)
- Last 5 years (0)
- Last 10 years (1)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Andrew V. Goldberg, Chris Harrelson
- SODA
- 2005

We propose shortest path algorithms that use A* search in combination with a new graph-theoretic lower-bounding technique based on landmarks and the triangle inequality. Our algorithms computeâ€¦ (More)

- Chris Harrelson, Kirsten Hildrum, Satish Rao
- SPAA
- 2003

RÃ¤cke recently gave a remarkable proof showing that any undirected multicommodity flow problem can be routed in an oblivious fashion with congestion that is within a factor of O(log3 n) of the bestâ€¦ (More)

- Hannah Bast, Erik Carlsson, +4 authors Fabien Viger
- ESA
- 2010

We show how to route on very large public transportation networks (up to half a billion arcs) with average query times of a few milliseconds. We take into account many realistic features like:â€¦ (More)

- Jittat Fakcharoenphol, Chris Harrelson, Satish Rao
- SODA
- 2003

We consider the k-traveling repairman problem, a generalization of the metric traveling repairman problem, also known as the minimum latency problem, to multiple repairmen. We give anâ€¦ (More)

- Chris Harrelson, Wei Wang
- 2003

LT codes are asymptotically optimal rateless erasure codes with highly efficient encoding and decoding algorithms. In the original analysis of these codes, it was assumed that for each encodingâ€¦ (More)

Given a graph <i>G</i> = (<i>V, E</i>), a set of terminals <i>T âŠ† V</i>, and a metric <i>D</i> on <i>T</i>, the <i>0-extension problem</i> is to assign vertices in <i>V</i> to terminals, so that theâ€¦ (More)

- Jittat Fakcharoenphol, Chris Harrelson, Satish Rao
- ACM Trans. Algorithms
- 2007

We consider the k-traveling repairmen problem, also known as the minimum latency problem, to multiple repairmen. We give a polynomial-time 8.497Î±-approximation algorithm for this generalization,â€¦ (More)

Given a metric space (X, d), a natural distance measure on probability distributions over X is the earthmover metric. We use randomized rounding of earthmover metrics to devise new approximationâ€¦ (More)

- Abraham Bachrach, Kevin C. Chen, Chris Harrelson, Radu Mihaescu, Satish Rao, Apurva Shah
- Comparative Genomics
- 2005

In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n) time dynamic programming algorithm forâ€¦ (More)

- Chris Harrelson, Lawren e Ipy, Wei Wangz
- 2008