O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems (Q3581406)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems |
scientific article |
Statements
O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems (English)
0 references
16 August 2010
0 references
