\(O(\sqrt{\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 the normal view instead:
scientific article; zbMATH DE number 5771382
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(O(\sqrt{\log n})\) approximation algorithms for Min UnCut, Min 2CNF deletion, and directed cut problems |
scientific article; zbMATH DE number 5771382 |
Statements
O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems (English)
0 references
16 August 2010
0 references
0.8023557662963867
0 references
0.7976946234703064
0 references
0.795421302318573
0 references
0.7881011366844177
0 references
