Upper and Lower Bounds for Online Routing on Delaunay Triangulations (Q3452783): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1501.01783 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Stretch Factor of L 1- and L  ∞ -Delaunay Triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Routing in Triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On plane geometric spanners: a survey and open problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive Online Routing on Delaunay Triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On plane constrained bounded-degree spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiently navigating a random Delaunay triangulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: There are planar graphs almost as good as the complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delaunay graphs are almost as good as complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Spanner Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Stretch Factor of the Delaunay Triangulation Is Less than 1.998 / rank
 
Normal rank

Latest revision as of 02:14, 11 July 2024

scientific article
Language Label Description Also known as
English
Upper and Lower Bounds for Online Routing on Delaunay Triangulations
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references