Bottleneck convex subsets: finding \(k\) large convex sets in a point set (Q2695286)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7670463
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bottleneck convex subsets: finding \(k\) large convex sets in a point set |
scientific article; zbMATH DE number 7670463 |
Statements
Bottleneck convex subsets: finding \(k\) large convex sets in a point set (English)
0 references
30 March 2023
0 references
computational geometry
0 references
convex set
0 references
FPT-algorithm
0 references
NP-hard
0 references
0 references
0 references
