A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere (Q1610661)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere |
scientific article; zbMATH DE number 1784324
| 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; zbMATH DE number 1784324 |
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
