On the Fermat-Weber center of a convex object (Q2571212): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The algebraic degree of geometric optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast approximations for sums of distances, clustering and the Fermat-Weber problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic optimization: The Fermat-Weber location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the continuous Weber and <i>k</i> -median problems (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4229604 / rank
 
Normal rank

Latest revision as of 10:02, 11 June 2024

scientific article
Language Label Description Also known as
English
On the Fermat-Weber center of a convex object
scientific article

    Statements

    On the Fermat-Weber center of a convex object (English)
    0 references
    0 references
    0 references
    0 references
    1 November 2005
    0 references
    A Fermat-Weber center of a point set \(S\) is a point that minimizes the average distance to the points in \(S\). The authors consider the case in which \(S\) is a convex object \(Q\) in the plane, and distances are measured by the Euclidean metric. For \(\Delta(Q)\) being the diameter of \(Q\), the authors show that the average distance of a Fermat-Weber center to the points in \(Q\) is always greater than \(\Delta/7\), and give an example for which \(\Delta/6\) is achieved. This result is used to obtain a linear-time approximation scheme for finding an approximate Fermat-Weber center of a convex polygon \(Q\).
    0 references
    0 references
    Fermat-Weber center
    0 references
    approximation algorithms
    0 references
    0 references