Essays about: "Max-Cut"

Found 2 essays containing the word Max-Cut.

  1. 1. Improved inapproximability of Max-Cut through Min-Cut

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Mårten Wiman; [2018]
    Keywords : Inapproximability; Max-Cut; 2-Lin 2 ; NP; Unique games;

    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

  3. 2. Approximation of Max-Cut on Graphs of Bounded Degree

    University essay from KTH/Skolan för datavetenskap och kommunikation (CSC)

    Author : Mikael Florén; [2016]
    Keywords : Theoretical Computer Science; Graphs; Algorithms; Max Cut; Approximation; Teoretisk Datalogi; Grafer; Algoritmer; Max Cut; Approximation;

    Abstract : The Max-Cut problem is a well-known NP-hard problem, for which numerous approximation algorithms have been developed over the years. In this thesis, we examine the special case where the degree of vertices in the graph is bounded. READ MORE