A minimum-length covering subtree of a tree (Q3479805): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
label / enlabel / en
 
A minimum-length covering subtree of a tree
Property / cites work
 
Property / cites work: Minimax location problems with nonlinear costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a nonlinear minimax location problem in tree networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3487357 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/1520-6750(199004)37:2<309::aid-nav3220370209>3.0.co;2-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2091044862 / rank
 
Normal rank
Property / title
 
A minimum-length covering subtree of a tree (English)
Property / title: A minimum-length covering subtree of a tree (English) / rank
 
Normal rank

Latest revision as of 10:28, 30 July 2024

scientific article
Language Label Description Also known as
English
A minimum-length covering subtree of a tree
scientific article

    Statements

    0 references
    0 references
    0 references
    0 references
    1990
    0 references
    central facility
    0 references
    tree network
    0 references
    subtree r-cover problem
    0 references
    minimum cardinality point cover
    0 references
    A minimum-length covering subtree of a tree (English)
    0 references

    Identifiers