Order Article Reprints
Journal: Algorithms, 2018
Volume: 11
Number: 10
Article:
Inapproximability of Maximum Biclique Problems, Minimum k-Cut and Densest At-Least-k-Subgraph from the Small Set Expansion Hypothesis
Authors:
by
Pasin Manurangsi
Link:
https://www.mdpi.com/1999-4893/11/1/10
MDPI offers high quality article reprints with convenient shipping to destinations worldwide. Each reprint features a 270 gsm bright white cover
and 105 gsm premium white paper, bound with two stitches for durability and printed in full color. The cover design is customized to your article
and designed to be complimentary to the journal.