The minimum covering Euclidean ball of a set of Euclidean balls in \(\mathbb{R}^n\) (Q6103201): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4945505 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spherical surface of smallest radius enclosing a bounded subset of 𝑛-dimensional euclidean space / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual simplex-type algorithm for the smallest enclosing ball of balls / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual algorithm for the minimum covering ball problem in \(\mathbb R^n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Minimum Covering Sphere Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692387 / 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: The Weighted Euclidean 1-Center Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3147657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003732 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution methodologies for the smallest enclosing circle problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for the smallest enclosing ball problem / rank
 
Normal rank

Revision as of 11:26, 1 August 2024

scientific article; zbMATH DE number 7701341
Language Label Description Also known as
English
The minimum covering Euclidean ball of a set of Euclidean balls in \(\mathbb{R}^n\)
scientific article; zbMATH DE number 7701341

    Statements

    The minimum covering Euclidean ball of a set of Euclidean balls in \(\mathbb{R}^n\) (English)
    0 references
    0 references
    0 references
    26 June 2023
    0 references
    location
    0 references
    convex programming
    0 references
    minimum covering ball
    0 references
    one-center location
    0 references
    min-max location
    0 references

    Identifiers

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