O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems

DOI10.1145/1060590.1060675zbMath1192.68864OpenAlexW2127114399MaRDI QIDQ3581406

Could not fetch data.

Publication date: 16 August 2010

Published in: (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1060590.1060675

Mathematics Subject Classification ID

Could not fetch data.