n-Ellipses and the Minimum Distance Sum Problem (Q2757353): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| label / en | label / en | ||
n-Ellipses and the Minimum Distance Sum Problem | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.2307/2589675 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4244478223 / rank | |||
Normal rank | |||
| Property / title | |||
n-Ellipses and the Minimum Distance Sum Problem (English) | |||
| Property / title: n-Ellipses and the Minimum Distance Sum Problem (English) / rank | |||
Normal rank | |||
Latest revision as of 21:26, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | n-Ellipses and the Minimum Distance Sum Problem |
scientific article |
Statements
26 November 2001
0 references
generalized ellipses
0 references
\(n\)-ellipses
0 references
curves with more foci
0 references
n-Ellipses and the Minimum Distance Sum Problem (English)
0 references
