Sökning: "Inapproximability"
Hittade 1 uppsats innehållade ordet Inapproximability.
1. Improved inapproximability of Max-Cut through Min-Cut
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : 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. LÄS MER
Resultatsidor:
1