An approximation algorithm for \(k\)-center problem on a convex polygon (Q2015790): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-012-9532-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2054853091 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of Parametric Searching in Geometric Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Base station placement on boundary of a convex polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 2-Center Problem with Obstacles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2704991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2766839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The p-center location problem in an area / rank
 
Normal rank

Latest revision as of 16:44, 8 July 2024

scientific article
Language Label Description Also known as
English
An approximation algorithm for \(k\)-center problem on a convex polygon
scientific article

    Statements

    An approximation algorithm for \(k\)-center problem on a convex polygon (English)
    0 references
    0 references
    0 references
    24 June 2014
    0 references
    0 references
    facility location
    0 references
    \(k\)-center
    0 references
    convex polygon
    0 references
    0 references