An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane (Q679454)

From MaRDI portal
scientific article
Language Label Description Also known as
English
An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane
scientific article

    Statements

    An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 May 1997
    0 references
    0 references
    grids
    0 references
    traveling salesman problem
    0 references
    minimum tree
    0 references
    0 references