Essays about: "Inapproximability"
Found 1 essay containing the word Inapproximability.
-
1. Improved inapproximability of Max-Cut through Min-Cut
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : A cut is a partition of a graph's nodes into two sets, and we say that an edge crosses the cut if it connects two nodes belonging to different sets. A maximum cut is a cut that maximises the number of crossing edges. READ MORE
Result pages:
1