| Document Date: 2012-07-29 14:44:15
Open Document File Size: 398,65 KBShare Result on Facebook
Company Vertex / Intel / / Facility Anthony Wirth The University of Melbourne Abstract / / IndustryTerm toss-based search / breadth-first-search trees / breadth-first-search tree / approximation algorithm / local search approaches / biological networks / brute force algorithm / involved algorithm / energy configurations / local search progresses / local search / regulatory network / rst approximation algorithm / locally-optimal solution / large-scale biological networks / optimum solution / local-search approach / rst search / approximation algorithms / parameter algorithm / / OperatingSystem MAC OS X 10.5 / / Organization University of Melbourne / Australian Research Council / / Person Tom Coleman / Williamson / Anthony Wirth / James Saunderson / / Technology 2-Correlation-Clustering 3.2 313 Switching-Invariant Algorithms / classic SDP-based approximation algorithm / rst approximation algorithm / Av / Matlab algorithms / PAST Algorithm / brute force algorithm / approximation algorithm / 4 The PASTA-flip Algorithm The PASTA-flip algorithm / LocalSearch algorithm / 2 Algorithms / 2.2 Local Search Local-search algorithms / Type Algorithms / 5 5.1 Experimental Work Algorithms / PTAS-like algorithm / approximation algorithms / ESA / PASTA-toss algorithm / two key algorithms / parameter algorithm / Goemans-Williamson style SDP algorithm / /
SocialTag |
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