"Almost-Polynomial Ratio ETH-Hardness of Approximating Densest k-Subgraph."

Pasin Manurangsi (2016)

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2022-09-27

a service of  Schloss Dagstuhl - Leibniz Center for Informatics