[9]
Aditya Bhaskara, Moses Charikar, Aravindan Vijayaraghavan, Venkatesan Guruswami, and Yuan Zhou.
Polynomial integrality gaps for strong SDP relaxations of densest
k
subgraph. In SODA, pages 388–405,
2012.
[10]
Mark Braverman, Young Kun Ko, Aviad Rubinstein, and Omri Weinstein. ETH hardness for densest
k

subgraph with perfect completeness. In SODA, pages 1326–1341, 2017.
[11]
Moses Charikar, MohammadTaghi Hajiaghayi, and Howard Karloff. Improved approximation algo
rithms for label cover problems. Algorithmica, 61(1):190–206, 2011.
[12]
Moses Charikar, Yonatan Naamad, Jennifer Rexford, and X. Kelvin Zou. Multicommodity ﬂow with
innetwork processing, submitted.
[13]
Moses Charikar, Yonatan Naamad, and Anthony Wirth. On approximating target set selection. In
APPROX, pages 4:1–4:16, 2016.
[14]
Ning Chen. On the approximability of inﬂuence in social networks. SIAM Journal on Discrete
Mathematics, 23(3):1400–1415, 2009.
[15]
Ramkumar Chinchani, Duc Ha, Anusha Iyer, Hung Q. Ngo, and Shambhu Upadhyaya. On the hardness
of approximating the MinHack problem. Journal of Combinatorial Optimization, 9(3):295–311, 2005.
[16]
Eden Chlamtac, Michael Dinitz, and Robert Krauthgamer. Everywheresparse spanners via dense
subgraphs. In FOCS, pages 758–767, 2012.
[17]
Eden Chlamt
´
a
ˇ
c, Michael Dinitz, and Yury Makarychev. Minimizing the union: Tight approximations
for small set bipartite vertex expansion. In SODA, pages 881–899, 2017.
[18]
Michael Dinitz, Guy Kortsarz, and Ran Raz. Label cover instances with large girth and the hardness of
approximating basic kspanner. ACM Transactions on Algorithms (TALG), 12(2):25, 2016.
[19]
Irit Dinur and Shmuel Safra. On the hardness of approximating labelcover. Information Processing
Letters, 89(5):247–254, 2004.
[20]
Pedro Domingos and Matt Richardson. Mining the network value of customers. In KDD, pages 57–66,
2001.
[21]
Michael Elkin and David Peleg. The hardness of approximating spanner problems. Theory of Computing
Systems, 41(4):691–729, 2007.
[22]
Uriel Feige. Relations between average case complexity and approximation complexity. In STOC,
pages 534–543, 2002.
[23]
Michael Goldwasser and Rajeev Motwani. Intractability of assembly sequencing: Unit disks in the
plane. In WADS, pages 307–320, 1997.
[24]
Mohammad Taghi Hajiaghayi and Kamal Jain. The prizecollecting generalized steiner tree problem
via a new approach of primaldual schema. In SODA, pages 631–640, 2006.
[25]
Russell Impagliazzo and Ramamohan Paturi. On the complexity of
k
SAT. Journal of Computer and
System Sciences, 62(2):367–375, 2001.
[26]
David Kempe, Jon Kleinberg, and
´
Eva Tardos. Maximizing the spread of inﬂuence through a social
network. Theory OF Computing, 11(4):105–147, 2015.
[27] Subhash Khot. On the power of unique 2prover 1round games. In STOC, pages 767–775, 2002.
[28]
Subhash Khot. Ruling out PTAS for graph minbisection, dense
k
subgraph, and bipartite clique. SIAM
Journal on Computing, 36(4):1025–1071, 2006.
[29] Guy Kortsarz. On the hardness of approximating spanners. Algorithmica, 30(3):432–450, 2001.
[30]
Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, and Elena Tsanko. Approximating minimumpower
degree and connectivity problems. Algorithmica, 60(4):735–742, 2011.
[31]
Pasin Manurangsi. Almostpolynomial ratio ETHhardness of approximating densest
k
subgraph. arXiv
preprint arXiv:1611.05991, 2016.
[32]
Pasin Manurangsi and Dana Moshkovitz. Improved approximation algorithms for projection games.
Algorithmica, 77(2):555–594, 2017.
10