2023
DOI: 10.1142/s0218195922410035
|View full text |Cite
|
Sign up to set email alerts
|

Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set

Abstract: Chvátal and Klincsek (1980) gave an [Formula: see text]-time algorithm for the problem of finding a maximum-cardinality convex subset of an arbitrary given set [Formula: see text] of [Formula: see text] points in the plane. This paper examines a generalization of the problem, the Bottleneck Convex Subsets problem: given a set [Formula: see text] of [Formula: see text] points in the plane and a positive integer [Formula: see text], select [Formula: see text] pairwise disjoint convex subsets of [Formula: see tex… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 18 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?