Algorithms for the minimum diameter terminal Steiner tree problem (Q489734): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-012-9591-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1963695813 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner problem with edge lengths 1 and 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A distributed algorithm for constructing a minimum diameter spanning tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved LP-based approximation for steiner tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828971 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Full and Bottleneck Full Steiner Tree Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximation algorithms for the terminal Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3514991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the terminal Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411284 / 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: Minimum Diameter Spanning Trees and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quicksort / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Internal Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the terminal Steiner tree problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the selected-internal Steiner tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the weight of shallow Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A better constant-factor approximation for selected-internal Steiner minimum tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The full Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for terminal Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a \((1+\varepsilon)\)-approximate geometric minimum-diameter spanning tree / rank
 
Normal rank

Latest revision as of 12:40, 9 July 2024

scientific article
Language Label Description Also known as
English
Algorithms for the minimum diameter terminal Steiner tree problem
scientific article

    Statements

    Algorithms for the minimum diameter terminal Steiner tree problem (English)
    0 references
    0 references
    0 references
    21 January 2015
    0 references
    terminal Steiner tree
    0 references
    monopolar
    0 references
    dipolar
    0 references

    Identifiers