The shortest path problem is a fundamental problem with numerous applications. In this paper
we study one of the most common variants of the problem, where the goal is to find a point…

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 …

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 …

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(log 3 …

Given a graph G=(V, E), a set of terminals TCV, and a metric D on T, the 0-extension problem
is to assign vertices in V to terminals, so that the sum, over all edges e, of the distance (…

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 …

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 …

A working or budding software engineer always benefits from deeply understanding the
platform their code runs on, and web browsers are the most common and widely-used platform …

… HARRELSON is professor of philosophy at Ball State University, where he also directs the
program in Health Humanities. He is author of The Ontological Argument from Descartes to …

Taking the lives and work of writers from the Upland South, this dissertation seeks to find out
how agrarian thinkers understood the place and meaning of rural life in the twentieth century…