7 search results - page 2 / 2 » Polyhedral results for the edge capacity polytope |
COMPGEOM
1998
ACM
13 years 9 months ago
1998
ACM
We present a new technique for constructing a data-structure that approximates shortest path maps in IRd . By applying this technique, we get the following two results on approxim...
MP
1998
13 years 5 months ago
1998
Consider a directed graph G = (V;A), and a set of tra c demands to be shipped between pairs of nodes in V. Capacity has to be installed on the edges of this graph (in integer mult...