Date: 2012-07-29 14:44:15

NP-complete problems

Matroid theory

Spanning tree

Signed graph

Graph

Clique

Tree

Combinatorial optimization

Eulerian path

Graph theory

Theoretical computer science

Mathematics

A Local-Search 2-Approximation for 2-Correlation-Clustering Tom Coleman, James Saunderson, and Anthony Wirth The University of Melbourne Abstract. CorrelationClustering is now an established problem in

Document is deleted from original location.
Use the Download Button below to download from the Web Archive.

File Size: 398,65 KB