SODA   1992 Symposium on Discrete Algorithms
Wall of Fame | Most Viewed SODA-1992 Paper
252views Algorithms» more  SODA 1992»
13 years 6 months ago
A General Approximation Technique for Constrained Forest Problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
Michel X. Goemans, David P. Williamson
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.
1Download preprint from source252
2Download preprint from source179
3Download preprint from source140
4Download preprint from source135
5Download preprint from source123
6Download preprint from source116
7Download preprint from source113
8Download preprint from source109
9Download preprint from source106
10Download preprint from source96
11Download preprint from source95
12Download preprint from source90
13Download preprint from source89
14Download preprint from source72