Approximation Algorithms for the Maximum Internal Spanning Tree Problem (Q3525559)

From MaRDI portal
Revision as of 12:39, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Approximation Algorithms for the Maximum Internal Spanning Tree Problem
scientific article

    Statements

    title
    Approximation Algorithms for the Maximum Internal Spanning Tree Problem (English)
    0 references
    author
    Gábor Salamon
    0 references
    publication date
    17 September 2008
    0 references
    Mathematics Subject Classification ID
    68W25
    0 references
    90C35
    0 references
    90C59
    0 references
    zbMATH DE Number
    5344648
    0 references
    zbMATH Keywords
    approximation algorithm
    0 references
    spanning tree leaves
    0 references
    Hamiltonian path
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3525559&oldid=27855424"
    Powered by MediaWiki