A simple heuristic for the p-centre problem (Q761233): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56324163, #quickstatements; #temporary_batch_1711055989931 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The p-Centre Problem-Heuristic and Optimal Algorithms / 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: Optimal packing and covering in the plane are NP-complete / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Easy and hard bottleneck location problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Complexity of Some Common Geometric Location Problems / rank | |||
Normal rank | |||
Latest revision as of 15:46, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple heuristic for the p-centre problem |
scientific article |
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
