Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets

Consider the following problem: given a set system (U,I) and an edge-weighted graph G = (U, E) on the same universe U, find the set A in I such that the Steiner tree cost with terminals A is as large as possible: "which set in I is the most difficult to connect up?" This is an example of a max-min problem: find the set A in I such that the value of some minimization (covering) problem is as large as possible. In this paper, we show that for certain covering problems which admit good deterministic online algorithms, we can give good algorithms for max-min optimization when the set system I is given by a p-system or q-knapsacks or both. This result is similar to results for constrained maximization of submodular functions. Although many natural covering problems are not even approximately submodular, we show that one can use properties of the online algorithm as a surrogate for submodularity. Moreover, we give stronger connections between max-min optimization and two-stage robust optimization, and hence give improved algorithms for robust versions of various covering problems, for cases where the uncertainty sets are given by p-systems and q-knapsacks.Comment: 17 pages. Preliminary version combining this paper and http://arxiv.org/abs/0912.1045 appeared in ICALP 201

Constructions of biangular tight frames and their relationships with equiangular tight frames

We study several interesting examples of Biangular Tight Frames (BTFs) - basis-like sets of unit vectors admitting exactly two distinct frame angles (ie, pairwise absolute inner products) - and examine their relationships with Equiangular Tight Frames (ETFs) - basis-like systems which admit exactly one frame angle. We demonstrate a smooth parametrization BTFs, where the corresponding frame angles transform smoothly with the parameter, which "passes through" an ETF answers two questions regarding the rigidity of BTFs. We also develop a general framework of so-called harmonic BTFs and Steiner BTFs - which includes the equiangular cases, surprisingly, the development of this framework leads to a connection with the famous open problem(s) regarding the existence of Mersenne and Fermat primes. Finally, we construct a (chordally) biangular tight set of subspaces (ie, a tight fusion frame) which "Pl\"ucker embeds" into an ETF.Comment: 19 page