## Organisers:

## Time:

## Venue:

## Webpage:

Abstract: We ask the following question: given a network with a large number of nodes, edges with nonnegative costs on them and a small set of special nodes called terminals, by how much can we compress the graph such that the shortest dis