Automated Parameter Tuning for the Maximum Clique Algorithm RPC

Student: Verentsov Sergey

Faculty: Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod)

Educational Programme: Applied Mathematics and Information Science (Bachelor)

Final Grade: 8

Year of Graduation: 2016

The present research introduces a new approach to using branch and bound method for solving maximum clique problem. The core of suggested idea is choosing the most efficient bounding function for each node of solution tree with methods of machine learning. Computational results based on DIMACS benchmark show that suggested approach is quite efficient in relation to RPC algorithm, which also uses several bounding functions.

Full text (added May 30, 2016)

Student Theses at HSE must be completed in accordance with the University Rules and regulations specified by each educational programme.

Summaries of all theses must be published and made freely available on the HSE website.

The full text of a thesis can be published in open access on the HSE website only if the authoring student (copyright holder) agrees, or, if the thesis was written by a team of students, if all the co-authors (copyright holders) agree. After a thesis is published on the HSE website, it obtains the status of an online publication.

Student theses are objects of copyright and their use is subject to limitations in accordance with the Russian Federation’s law on intellectual property.

In the event that a thesis is quoted or otherwise used, reference to the author’s name and the source of quotation is required.

Search all student theses