Name
Abstract | ||
|---|---|---|
We give a number of structural results for the problem of constructing a minimum-length 2-connected network for a set of terminals in a graph, where edge-weights satisfy the triangle inequality. A new algorithmic framework, based on our structural results, is given. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1016/j.orl.2004.07.010 | Oper. Res. Lett. |
Keywords | Field | DocType |
triangle inequality,survivable networks,structural result,2-connected steiner networks,two-connected steiner network,2-connected network,2-connected steiner networks.,structural property,new algorithmic framework,lower bound,satisfiability | Graph,Discrete mathematics,Complete graph,Combinatorics,Algorithmics,Steiner tree problem,Triangle inequality,Connectivity,Mathematics | Journal |
Volume | Issue | ISSN |
33 | 4 | Operations Research Letters |
Citations | PageRank | References |
8 | 0.71 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pawel Winter | 1 | 99 | 12.98 |
| Martin Zachariasen | 2 | 343 | 29.69 |