Improved inapproximability of Max-Cut through Min-Cut
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. We show that for any sufficiently small ε > 0 it is NP-hard to distingu...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
KTH, Skolan för elektroteknik och datavetenskap (EECS)
2018
|
| Subjects: | |
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-231587 |