Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Gordon Wichern
Daniel P. Kennedy
Roland Zumkeller
Maximilian Dürr
Dan Graur
Liangliang Shang
Eli Yammine
Chen Ma
Barbara Aquilani
Michael Z. Hanani
Home
/
Paper
/
The Projection Games Conjecture and the NP-Hardness of ln n-Approximating Set-Cover.
Paper Info
Open Visualization
Title
The Projection Games Conjecture and the NP-Hardness of ln n-Approximating Set-Cover.
Year
Venue
DocType
2015
Theory of Computing
Journal
Volume
Citations
PageRank
11
40
1.38
References
Authors
26
1
Authors (1 rows)
Cited by (40 rows)
References (26 rows)
Name
Order
Citations
PageRank
Dana Moshkovitz
1
368
19.14
1