Light orthogonal networks with constant geometric dilation (Q1013080): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
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.1016/j.jda.2008.07.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1991315286 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sparse spanners of weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse geometric graphs with small dilation / 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: The minimum Manhattan network problem: Approximations and exact solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional divide-and-conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two probabilistic results on rectilinear Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing plane spanners of bounded degree and low weight / rank
 
Normal rank
Property / cites work
 
Property / cites work: NEW SPARSENESS RESULTS ON GRAPH SPANNERS / 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: Q3484375 / 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: On the geometric dilation of closed curves, graphs, and point sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579491 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geometric dilation of finite point sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for approximating the detour of a polygonal chain. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2748154 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic orthogonal segment intersection search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of graphs which approximate the complete Euclidean graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Spanner Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal Range Searching in Linear and Almost-Linear Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectilinear Steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Data Structures for Orthogonal Range Queries / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 11:18, 1 July 2024

scientific article
Language Label Description Also known as
English
Light orthogonal networks with constant geometric dilation
scientific article

    Statements

    Light orthogonal networks with constant geometric dilation (English)
    0 references
    0 references
    0 references
    16 April 2009
    0 references
    network design
    0 references
    geometric dilation
    0 references
    stretch factor
    0 references
    detour
    0 references
    plane straight line graph
    0 references
    orthogonal network
    0 references
    Steiner vertices
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers