On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane \(\mathbb{R}^2\) (Q828689): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q114222159, #quickstatements; #temporary_batch_1711055989931
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A faster circle-sweep Delaunay triangulation algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalised \(k\)-Steiner tree problems in normed planes / 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: A constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibonacci heaps and their uses in improved network optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A good algorithm for smallest spanning trees with a degree constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for a family of matroid intersection problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 1-steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4068469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4691686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4217266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4782696 / rank
 
Normal rank

Revision as of 16:34, 25 July 2024

scientific article
Language Label Description Also known as
English
On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane \(\mathbb{R}^2\)
scientific article

    Statements

    On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane \(\mathbb{R}^2\) (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 May 2021
    0 references
    a fixed line \(l\)
    0 references
    Steiner tree
    0 references
    Steiner points
    0 references
    Delaunay triangulation
    0 references
    approximation algorithms
    0 references

    Identifiers