Reoptimization of Steiner trees: changing the terminal set (Q838156): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Juraj Hromkovič / rank
Normal rank
 
Property / author
 
Property / author: Juraj Hromkovič / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1977823240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimizing the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization of Minimum and Maximum Traveling Salesman’s Tours / 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: Q3079180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2867366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Algorithm for the Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic number of graphs not containing a fixed color-critical subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952699 / rank
 
Normal rank

Revision as of 21:21, 1 July 2024

scientific article
Language Label Description Also known as
English
Reoptimization of Steiner trees: changing the terminal set
scientific article

    Statements

    Reoptimization of Steiner trees: changing the terminal set (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 August 2009
    0 references
    approximation algorithms
    0 references
    reoptimization
    0 references
    Steiner tree
    0 references

    Identifiers