Solving the prize‐collecting Euclidean Steiner tree problem (Q6071078): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the complexity of the Steiner problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal interconnection trees in the plane. Theory, algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3689203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCIP-Jack -- a solver for STP and variants with parallelization extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Computing Steiner Minimal Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Minimal Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Approximation Technique for Constrained Forest Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for determining the convex hull of a finite planar set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for node-weighted geometric Steiner tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner ratio conjecture for six points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Steiner hull algorithm / rank
 
Normal rank

Latest revision as of 14:45, 19 August 2024

scientific article; zbMATH DE number 7771166
Language Label Description Also known as
English
Solving the prize‐collecting Euclidean Steiner tree problem
scientific article; zbMATH DE number 7771166

    Statements

    Identifiers