Euclidean chains and their shortcuts (Q391221): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Algorithms for Reporting and Counting Geometric Intersections / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Comments on “algorithms for reporting and counting geometric intersections” / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Facility location and the geometric minimum-diameter spanning tree. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimum Diameter Spanning Trees and Related Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3992847 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computing a \((1+\varepsilon)\)-approximate geometric minimum-diameter spanning tree / rank | |||
Normal rank | |||
Latest revision as of 05:46, 7 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Euclidean chains and their shortcuts |
scientific article |
Statements
Euclidean chains and their shortcuts (English)
0 references
10 January 2014
0 references
Euclidean graph
0 references
computational geometry
0 references
diameter
0 references
