1 code implementation • 6 Mar 2020 • Theja Tulabandhula, Deeksha Sinha, Saketh Karra
For an arbitrary collection of assortments, our algorithms can find a solution in time that is sub-linear in the number of assortments, and for the simpler case of cardinality constraints - linear in the number of items (existing methods are quadratic or worse).