Computing all large sums-of-pairs in \(\mathbb R^n\) and the discrete planar two-watchtower problem (Q1029066): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4551354 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Matrix multiplication via arithmetic progressions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computing dominances in \(E^ n\) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms / rank | |||
Normal rank | |||
Latest revision as of 19:03, 1 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing all large sums-of-pairs in \(\mathbb R^n\) and the discrete planar two-watchtower problem |
scientific article |
Statements
Computing all large sums-of-pairs in \(\mathbb R^n\) and the discrete planar two-watchtower problem (English)
0 references
9 July 2009
0 references
algorithms
0 references
computational geometry
0 references
facility location
0 references
