Tight Running Time Lower Bounds for Strong Inapproximability of Maximum k -Coverage, Unique Set Cover and Related Problems (via t -Wise Agreement Testing Theorem)

SODA 2020

Conference Paper Accepted Paper Algorithms and Complexity · Theoretical Computer Science

Abstract

No abstract is available in the live database for this paper.

No keywords are indexed for this paper.