# Expected Computations on Color Spanning Sets

Journal of Combinatorial Optimization, Volume 29, Issue 3, 2015, Pages 589-604.

Cited by: 1|Views6
EI WOS SCOPUS

Abstract:

Given a set of $n$ n points, each is painted by one of the $k$ k given colors, we want to choose $k$ k points with distinct colors to form a color spanning set. For each color spanning set, we can construct the convex hull and the smallest axis-aligned enclosing rectangle, etc. Assuming that each point is chosen independently and id...More

Code:

Data:

Get fulltext within 24h
Bibtex