A simple heuristic for the p-centre problem (Q761233)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A simple heuristic for the p-centre problem |
scientific article; zbMATH DE number 3887397
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple heuristic for the p-centre problem |
scientific article; zbMATH DE number 3887397 |
Statements
A simple heuristic for the p-centre problem (English)
0 references
1985
0 references
We describe a simple heuristic for determining the p-centre of a finite set of weighted points in an arbitrary metric space. The computational effort is O(np) for an n-point set. We show that the ratio of the objective function value of the heuristic solution to that of the optimum is bounded by \(\min (3,1+\alpha)\), where \(\alpha\) is the maximum weight divided by the minimum weight of points in the set.
0 references
heuristic
0 references
p-centre
0 references
finite set of weighted points
0 references
0 references
