O(√log n) approximation algorithms for Min UnCut, Min 2CNF Deletion, and Directed Cut problems

Amit Agarwal*, Konstantin Makarychev, Moses Charikar, Yury Makarychev

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

140 Scopus citations

Fingerprint

Dive into the research topics of 'O(√log n) approximation algorithms for Min UnCut, Min 2CNF Deletion, and Directed Cut problems'. Together they form a unique fingerprint.

INIS

Mathematics