Essays about: "Mårten Wiman"

Found 2 essays containing the words Mårten Wiman.

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. Improved Constructions of Unbalanced Uniquely Decodable Code Pairs

   University essay from KTH/Skolan för teknikvetenskap (SCI)

   Author : Mårten Wiman; [2017]
   Keywords : ;

   Abstract : .... READ MORE