An <i>O</i>(log <i>k</i>) approximation algorithm for the <i>k</i> minimum spanning tree problem in the plane (Q2817634)

From MaRDI portal
Revision as of 11:48, 17 August 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
An <i>O</i>(log <i>k</i>) approximation algorithm for the <i>k</i> minimum spanning tree problem in the plane
scientific article

    Statements

    An <i>O</i>(log <i>k</i>) approximation algorithm for the <i>k</i> minimum spanning tree problem in the plane (English)
    0 references
    0 references
    0 references
    0 references
    1 September 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references