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

The Digital Librarian's Digital Library

DOCIS Documents in Computing and Information Science

Home >> Journals and Conference Proceedings >> ACM Symposium on Theory of Computing

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

Amit Agarwal, Moses Charikar, Konstantin Makarychev, Yury Makarychev

Journal Title: ACM Symposium on Theory of Computing

Date: 2005

For further information about this item go to:

http://doi.acm.org/10.1145/1060675

This data comes from DBLP

This page is maintained by Angela Cornwell and Thomas Krichel.
It was last updated on 2006-04-12