sentence1: under the assumption of the unique games conjecture , raghavendra has shown that the basic semidefinite programming relaxation solves all tractable finite-valued csps .
sentence2: raghavendra showed that for all csps , the natural analogue of the goemans-williamson sdp algorithm has optimal approximation guarantee among all efficient algorithms , subject to the unique games conjecture .