ECCC   2000
Wall of Fame | Most Viewed ECCC-2000 Paper
179views more  ECCC 2000»
9 years 7 months ago
A Note on Approximating MAX-BISECTION on Regular Graphs
We design a 0:795 approximation algorithm for the Max-Bisection problem restricted to regular graphs. In the case of three regular graphs our results imply an approximation ratio ...
Uriel Feige, Marek Karpinski, Michael Langberg
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 source179
2Download preprint from source158
3Download preprint from source140
4Download preprint from source120
5Download preprint from source117
6Download preprint from source113
7Download preprint from source101
8Download preprint from source93
9Download preprint from source93
10Download preprint from source86
11Download preprint from source86
12Download preprint from source81
13Download preprint from source77
14Download preprint from source75
15Download preprint from source72
16Download preprint from source59