A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in \(\Re ^{d }\) (Q763244): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: GeoSteiner / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: FindSteinerTree / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SeDuMi / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OR-Library / rank
 
Normal rank
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/s10732-010-9137-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1995356291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A delaunay triangulation‐based heuristic for the euclidean steiner problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Trees for Ladders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two heuristics for the Euclidean Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of the Gilbert-Pollak conjecture on the Steiner ratio / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space / 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: Q2759665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542574 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental evaluation of a partitioning algorithm for the steiner tree problem in <i>R</i><sup>2</sup> and <i>R</i><sup>3</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to find Steiner minimal trees in Euclidean \(d\)-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n logn) heuristic for steiner minimal tree problems on the euclidean metric / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(N<sup>2</sup>) heuristic for steiner minimal trees in E<sup>3</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5657944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sausage heuristic for Steiner minimal trees in three-dimensional Euclidean space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search for the Steiner tree problem in the Euclidean plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concatenation-based greedy heuristics for the Euclidean Steiner tree problem / rank
 
Normal rank

Latest revision as of 00:15, 5 July 2024

scientific article
Language Label Description Also known as
English
A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in \(\Re ^{d }\)
scientific article

    Statements

    A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in \(\Re ^{d }\) (English)
    0 references
    0 references
    0 references
    9 March 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    Steiner tree
    0 references
    Delaunay triangulation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references