The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition (Q2441579): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: New constructions of SSPDs and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Region-fault tolerant geometric spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles of Distributed Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On exact solutions to the Euclidean bottleneck Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for approximating distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: On separating systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication-Efficient Construction of the Plane Localized Delaunay Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition of multidimensional point sets with applications to <i>k</i> -nearest-neighbors and <i>n</i> -body potential fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON ENUMERATING AND SELECTING DISTANCES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations for Steiner trees with minimum number of Steiner points / 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: Generalized Selection and Ranking: Sorted Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Net and prune / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Expander-Based Approach to Geometric Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3802644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner tree problem with minimum number of Steiner points and bounded edge-length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Spanner Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On bounded leg shortest paths problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations for a bottleneck Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Constructing Minimum Spanning Trees in <i>k</i>-Dimensional Spaces and Related Problems / rank
 
Normal rank

Latest revision as of 13:00, 7 July 2024

scientific article
Language Label Description Also known as
English
The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition
scientific article

    Statements

    The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 March 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    geometric optimization
    0 references
    pair decomposition
    0 references
    spanners
    0 references
    distance selection
    0 references
    0 references