TAMC   2009 Theory and Applications of Models of Computation
Wall of Fame | Most Viewed TAMC-2009 Paper
13 years 6 months ago
Approximation and Hardness Results for Label Cut and Related Problems
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classi´Čüed into ...
Peng Zhang, Jin-yi Cai, Linqing Tang, Wenbo Zhao
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 source207
2Download preprint from source149
3Download preprint from source146
4Download preprint from source143
5Download preprint from source141
6Download preprint from source140
7Download preprint from source139
8Download preprint from source130
9Download preprint from source117
10Download preprint from source104
11Download preprint from source104
12Download preprint from source104
13Download preprint from source99
14Download preprint from source88
15Download preprint from source87
16Download preprint from source79