Minimum restricted diameter spanning trees. (Q1427810): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Graph-Theoretic Game and Its Application to the <i>k</i>-Server Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768295 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum diameter spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing multi-commodity flow trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Call routing and the ratcatcher / rank
 
Normal rank

Latest revision as of 14:34, 6 June 2024

scientific article
Language Label Description Also known as
English
Minimum restricted diameter spanning trees.
scientific article

    Statements

    Minimum restricted diameter spanning trees. (English)
    0 references
    0 references
    0 references
    14 March 2004
    0 references
    Combinatorial optimization
    0 references
    Approximation algorithms
    0 references
    Minimum diameter spanning trees
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references