Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems (Q1978696)

From MaRDI portal
Revision as of 02:32, 30 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
scientific article

    Statements

    Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 June 2000
    0 references
    0 references
    approximation algorithms
    0 references
    semi-definite programming
    0 references
    minimum bandwidth problem
    0 references