A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere (Q1610661)

From MaRDI portal
Revision as of 09:06, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    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
    0 references
    0 references

    Identifiers