On the ball spanned by balls (Q1264087): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: The weighted Euclidean 1-center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming in \(O(n\times 3^{d^2})\) time / 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: On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem / 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: Linear Programming in Linear Time When the Dimension Is Fixed / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(nlogn) randomizing algorithm for the weighted euclidean 1-center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing circular separability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the geodesic center of a simple polygon / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2135412646 / rank
 
Normal rank

Latest revision as of 11:11, 30 July 2024

scientific article
Language Label Description Also known as
English
On the ball spanned by balls
scientific article

    Statements

    On the ball spanned by balls (English)
    0 references
    0 references
    1989
    0 references
    The author presents a linear-time algorithm for a class of problems including the multiplicative weighted-center problem, that is, there are some demand points and one seeks a facility location to minimize the largest weighted distance between the facility and any demand point. The main example is the problem of finding the smallest ball enclosing n given balls.
    0 references
    linear-time algorithm
    0 references
    multiplicative weighted-center problem
    0 references
    facility location
    0 references

    Identifiers

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