Show simple item record

dc.contributor.authorPullan, Wayneen_US
dc.date.accessioned2017-05-03T13:58:13Z
dc.date.available2017-05-03T13:58:13Z
dc.date.issued2008en_US
dc.date.modified2009-09-16T07:43:27Z
dc.identifier.issn15729397en_US
dc.identifier.doi10.1007/s10732-007-9026-2en_AU
dc.identifier.urihttp://hdl.handle.net/10072/18582
dc.description.abstractThis paper extends the recently introduced Phased Local Search (PLS) algorithm to more difficult maximum clique problems and also adapts the algorithm to handle maximum vertex/edge weighted clique instances. PLS is a stochastic reactive dynamic local search algorithm that interleaves sub-algorithms which alternate between sequences of iterative improvement, during which suitable vertices are added to the current sub-graph, and plateau search, where vertices of the current sub-graph are swapped with vertices not contained in the current sub-graph. These sub-algorithms differ in firstly their vertex selection techniques in that selection can be solely based on randomly selecting a vertex, randomly selecting within highest vertex degree, or random selecting within vertex penalties that are dynamically adjusted during the search. Secondly, the perturbation mechanism used to overcome search stagnation differs between the sub-algorithms. PLS has no problem instance dependent parameters and achieves state-of-the-art performance for maximum clique and maximum vertex/edge weighted clique problems over a large range of the commonly used DIMACS benchmark instances.en_US
dc.description.peerreviewedYesen_US
dc.description.publicationstatusYesen_AU
dc.languageEnglishen_US
dc.language.isoen_AU
dc.publisherSpringeren_US
dc.publisher.placeNetherlandsen_US
dc.relation.ispartofstudentpublicationNen_AU
dc.relation.ispartofpagefrom117en_US
dc.relation.ispartofpageto134en_US
dc.relation.ispartofissue2en_US
dc.relation.ispartofjournalJournal of Heuristicsen_US
dc.relation.ispartofvolume14en_US
dc.rights.retentionYen_AU
dc.subject.fieldofresearchcode289999en_US
dc.titleApproximating the maximum vertex/edge weighted clique using local searchen_US
dc.typeJournal articleen_US
dc.type.descriptionC1 - Peer Reviewed (HERDC)en_US
dc.type.codeC - Journal Articlesen_US
gro.facultyGriffith Sciences, School of Information and Communication Technologyen_US
gro.date.issued2008
gro.hasfulltextNo Full Text


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

  • Journal articles
    Contains articles published by Griffith authors in scholarly journals.

Show simple item record