APPROX 2000 International Workshop on Approximation Algorithms for
 |  |
Wall of Fame | Most Viewed APPROX-2000 Paper
APPROX
2000
Springer
13 years 8 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website.
Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
| Id | Read | Views | Title | Status |
|---|---|---|---|---|
| 1 |  | 190 | ||
| 2 | | 153 | ||
| 3 | | 126 | ||
| 4 | | 122 | ||
| 5 | | 107 | ||
| 6 | | 84 |