An approximation algorithm for the maximum leaf spanning arborescence problem (Q2930326)

From MaRDI portal
Revision as of 01:52, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An approximation algorithm for the maximum leaf spanning arborescence problem
scientific article

    Statements

    title
    An approximation algorithm for the maximum leaf spanning arborescence problem (English)
    0 references
    author
    Matthew Drescher
    0 references
    Adrian Vetta
    0 references
    publication date
    18 November 2014
    0 references
    Mathematics Subject Classification ID
    68W25
    0 references
    68Q17
    0 references
    05C05
    0 references
    zbMATH DE Number
    6370657
    0 references
    zbMATH Keywords
    approximation algorithms
    0 references
    arborescence
    0 references
    directed graphs
    0 references
    maximum leaf
    0 references
    Wikidata QID
    Q56502745
    0 references
    OpenAlex ID
    W2083082533
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2930326&oldid=32678384"
    Powered by MediaWiki