A \(2^{|E|/4}\)-time algorithm for MAX-CUT (Q2577592): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4230322 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithms for Sat and upper bounds on their complexity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4840774 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimization, approximation, and complexity classes / rank | |||
Normal rank |
Latest revision as of 13:38, 11 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A \(2^{|E|/4}\)-time algorithm for MAX-CUT |
scientific article |
Statements
A \(2^{|E|/4}\)-time algorithm for MAX-CUT (English)
0 references
3 January 2006
0 references
0 references