| Title: |
ETH Hardness for Densest-k-Subgraph with Perfect Completeness |
| Article URLs: |
|
| Alternative Article URLs: |
|
| Authors: |
Mark Braverman |
-
Princeton University, Department of Computer Science
|
| Young Kun-Ko |
-
Princeton University, Department of Computer Science
|
| Aviad Rubinstein |
-
University of California - Berkeley, Department of Electrical Engineering and Computer Sciences
|
| Omri Weinstein |
-
New York University, Department of Computer Science
-
New York University, Courant Institute
|
| Sharing: |
Unknown
|
| Verification: |
Authors have
not verified
information
|
| Artifact Evaluation Badge: |
none
|
| Artifact URLs: |
|
| Artifact Correspondence Email Addresses: |
|
| NSF Award Numbers: |
1149888,
1408635
|
| DBLP Key: |
conf/soda/BravermanKRW17
|
| Author Comments: |
|