Reactive and dynamic local search for Max-Clique, does the complexity pay off?

Battiti, Roberto and Mascia, Franco (2006) Reactive and dynamic local search for Max-Clique, does the complexity pay off? UNSPECIFIED. (Unpublished)

[img]
Preview
 PDF
Download (161Kb) | Preview

    Abstract

    This paper presents some preliminary results of an ongoing investigation about how different algorithmic building blocks contribute to solving the Maximum Clique problem. In detail, we consider greedy constructions, plateau searches, and more complex schemes based on dynamic penalties and/or prohibitions, in particular the recently proposed technique of Dynamic Local Search and the previously proposed Reactive Local Search. The experimental results consider both the empirical hardness, measured by the iterations needed to reach empirical maxima, and the CPU time per iteration.

    Item Type: Departmental Technical Report
    Department or Research center: Information Engineering and Computer Science
    Subjects: Q Science > QA Mathematics > Q360 Information Theory
    Q Science > QA Mathematics > QA075 Electronic computers. Computer science
    Q Science > QA Mathematics > QA076 Computer software
    Report Number: DIT-06-027
    Repository staff approval on: 12 May 2006

    Actions (login required)

    		 View Item