A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere (Q1610661): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: QUALEX / rank | |||
Normal rank | |||
Revision as of 04:40, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere |
scientific article |
Statements
A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere (English)
0 references
20 August 2002
0 references
For a given graph the maximum independent set problem is to find a maximum subset of vertices no two of which are adjacent. We propose a heuristic for the maximum independent set problem which utilizes classical results for the problem of optimization of a quadratic function over a sphere. The efficiency of the approach is confirmed by results of numerical experiments on DIMACS benchmarks.
0 references
