The hardness of approximating set cover

From MaRDI portal

Revision as of 12:10, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4571895

Jump to:navigation, search

DOI10.1007/BFb0053020zbMath1401.68103OpenAlexW1584049688MaRDI QIDQ4571895

Alexander Wolff

Publication date: 3 July 2018

Published in: Lectures on Proof Verification and Approximation Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0053020

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: The hardness of approximating set cover

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4571895&oldid=18716694"