2063 search results - page 13 / 413 » connection 2007 |
106
click to vote
WADS
2007
Springer
15 years 6 months ago
2007
Springer
Connectivity augmentation problems ask for adding a set of at most k edges whose insertion makes a given graph satisfy a specified connectivity property, such as bridge-connectivi...
ALGORITHMICA
2004
15 years 10 days ago
2004
We consider the Connected Facility Location problem. We are given a graph G = (V, E) with costs {ce} on the edges, a set of facilities F V , and a set of clients D V . Facility ...
61
Voted
ISCC
2007
IEEE
15 years 6 months ago
2007
IEEE
NECO
2007
14 years 12 months ago
2007
107
Voted
ALGORITHMICA
2002
15 years 10 days ago
2002
It is shown that, for every strongly connected network in which every edge has capacity at least , linear time suffices to send flow from source vertices, each with a given supply,...