Steiner tree reoptimization in graphs with sharpened triangle inequality (Q414457): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jda.2011.03.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2042882430 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimizing the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimizing the 0-1 knapsack 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: Reoptimization of Steiner Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization of the Shortest Common Superstring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization of Weighted Graph and Covering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization of the Metric Deadline TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the TSP with sharpened triangle inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hardness of Reoptimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization of Steiner trees: changing the terminal set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2867366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximability of the Steiner tree problem in phylogeny / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Steiner trees in graphs with restricted weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with forbidden sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258215 / rank
 
Normal rank

Latest revision as of 04:06, 5 July 2024

scientific article
Language Label Description Also known as
English
Steiner tree reoptimization in graphs with sharpened triangle inequality
scientific article

    Statements

    Steiner tree reoptimization in graphs with sharpened triangle inequality (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    11 May 2012
    0 references
    Steiner tree
    0 references
    reoptimization
    0 references
    approximation algorithms
    0 references
    approximability
    0 references
    sharpened triangle inequality
    0 references

    Identifiers