On the complexity of locating linear facilities in the plane (Q1837617): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: DBLP publication ID (P1635): journals/orl/MegiddoT82, #quickstatements; #temporary_batch_1731547958265 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Q4131987 / 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: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5514221 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding Least-Distances Lines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5669010 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Worst-Case and Probabilistic Analysis of a Geometric Location Problem / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/orl/MegiddoT82 / rank | |||
Normal rank | |||
Latest revision as of 02:46, 14 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of locating linear facilities in the plane |
scientific article |
Statements
On the complexity of locating linear facilities in the plane (English)
0 references
1982
0 references
p-line centre
0 references
p-line median
0 references
NP-completeness
0 references
computational complexity
0 references
linear facility location in the plane
0 references
NP-hardness in the strong sense
0 references
