Minimum-sum dipolar spanning tree in \(\mathbb R^3\) (Q452446): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1570657273 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1007.1222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The discrete 2-center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiently approximating polygonal paths in three and higher dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3323958 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-Online Maintenance of Geometric Optima and Measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Algorithms for Two- and Three-Variable Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facility location and the geometric minimum-diameter spanning tree. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3237947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Diameter Spanning Trees and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On k-Nearest Neighbor Voronoi Diagrams in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Geometry in C / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection of unit-balls and diameter of a point set in \(\mathbb R^3\). / rank
 
Normal rank
Property / cites work
 
Property / cites work: A near-linear algorithm for the planar 2-center problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:43, 5 July 2024

scientific article
Language Label Description Also known as
English
Minimum-sum dipolar spanning tree in \(\mathbb R^3\)
scientific article

    Statements

    Minimum-sum dipolar spanning tree in \(\mathbb R^3\) (English)
    0 references
    0 references
    0 references
    21 September 2012
    0 references
    0 references
    computational geometry
    0 references
    dipolar spanning tree
    0 references
    algorithm
    0 references
    intersection of balls
    0 references
    communication networks
    0 references
    0 references
    0 references