Partial sublinear time approximation and inapproximation for maximum coverage

DOI10.1007/978-3-319-94776-1_41OpenAlexW2963600101MaRDI QIDQ1791009

Bin Fu

Publication date: 4 October 2018

Full work available at URL: https://arxiv.org/abs/1604.01421

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (1)

Approximate set union via approximate randomization

This page was built for publication: Partial sublinear time approximation and inapproximation for maximum coverage