Linear time algorithm for optimal feed-link placement (Q482338): 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: W2002016998 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1208.0395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network farthest-point diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Stretch Factor of Euclidean Graphs / 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: Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D / 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: Another efficient algorithm for convex hulls in two dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving polynomial equations. Foundations, algorithms, and applications / rank
 
Normal rank

Latest revision as of 12:12, 9 July 2024

scientific article
Language Label Description Also known as
English
Linear time algorithm for optimal feed-link placement
scientific article

    Statements

    Identifiers

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