An Approximation Algorithm for the Continuous <i>k</i>-Medians Problem in a Convex Polygon (Q2962556): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Minimum-cost load-balancing partitions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4542527 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A constant-factor approximation algorithm for the \(k\)-median problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Continuous Fermat-Weber Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4325916 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, <i>k</i>-MST, and Related Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Worst-Case and Probabilistic Analysis of a Geometric Location Problem / rank | |||
Normal rank | |||
Latest revision as of 10:21, 13 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Approximation Algorithm for the Continuous <i>k</i>-Medians Problem in a Convex Polygon |
scientific article |
Statements
An Approximation Algorithm for the Continuous <i>k</i>-Medians Problem in a Convex Polygon (English)
0 references
17 February 2017
0 references
approximation algorithms
0 references
geometric algorithms
0 references
continuous location theory
0 references
