k-Coverage, Unique Set Cover and Related Problems (via t-Wise Agreement Testing Theorem).">k-Coverage, Unique Set Cover and Related Problems (via t-Wise Agreement Testing Theorem)., dblp, computer science, bibliography, knowledge graph, author, editor, publication, conference, journal, book, thesis, database, collection, open data, bibtex">

default search action

combined dblp search
author search
venue search
publication search

ask others

"Tight Running Time Lower Bounds for Strong Inapproximability of Maximum ..."

Pasin Manurangsi (2020)

> Home

Details and statistics

DOI: 10.1137/1.9781611975994.5

access: open

type: Conference or Workshop Paper

metadata version: 2021-07-15

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/soda/Manurangsi20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/Manurangsi20
Pasin Manurangsi:
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: 62-81

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.