activity
20192022
most citedSome Results on Approximability of Minimum Sum Vertex Cover

3 citations · 3 across the 1 of their papers we have counts for

collaborators
Showing 2019Show all

1 paper · 1 filter

cs.CC2019

Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder

Per Austrin, Aleksa Stankovic

Assuming the Unique Games Conjecture, we show that existing approximation algorithms for some Boolean Max-2-CSPs with cardinality constraints are optimal. In particular, we prove t…