Browsing by Subject Hardness
Showing results 1 to 2 of 2
| Issue Date | Title | Author(s) |
|---|---|---|
| 2017 | Hardness from Densest Subgraph Conjectures | Naamad, Yonatan |
| 2013 | New Results in the Theory of Approximation: Fast Graph Algorithms and Inapproximability | Sachdeva, Sushant |