We studied the following two geometric optimization problems with cardinality constraints. • Capacitated covering with unit balls: Given a set of n points in R and a positive integer L, partition them into a minimum number of groups such that each group contains at most L points, and can be covered by a unit ball in R. • Capacitated connected dominating set in unit disk graph: Given a positive ...