Near-linear-time deterministic plane Steiner spanners for well-spaced point sets (Q906836): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3105802762 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1206.2254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sparse spanners of weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar spanners and approximate shortest path queries among obstacles in the plane / 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: Q4234097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provably good mesh generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: PARALLEL CONSTRUCTION OF QUADTREES AND QUALITY TRIANGULATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>O</i> ( <i>n</i> log <i>n</i> ) approximation scheme for Steiner tree in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delaunay triangulations in <i>O</i> (sort( <i>n</i> )) time and more / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for intersecting line segments in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A subset spanner for Planar graphs, with application to subset TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, <i>k</i>-MST, and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Spanner Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The isoperimetric problem for pinwheel tilings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542574 / rank
 
Normal rank

Latest revision as of 09:15, 11 July 2024

scientific article
Language Label Description Also known as
English
Near-linear-time deterministic plane Steiner spanners for well-spaced point sets
scientific article

    Statements

    Near-linear-time deterministic plane Steiner spanners for well-spaced point sets (English)
    0 references
    0 references
    0 references
    29 January 2016
    0 references
    spanner
    0 references
    sparse
    0 references
    Euclidean TSP
    0 references

    Identifiers