| Title: |
Better Approximations for Tree Sparsity in Nearly-Linear Time |
| Article URLs: |
|
| Alternative Article URLs: |
|
| Authors: |
Arturs Backurs |
-
Massachusetts Institute of Technology, Computer Science and Artificial Intelligence Laboratory
|
| Piotr Indyk |
-
Massachusetts Institute of Technology, Computer Science and Artificial Intelligence Laboratory
|
| Ludwig Schmidt |
-
Massachusetts Institute of Technology, Computer Science and Artificial Intelligence Laboratory
|
| Sharing: |
Unknown
|
| Verification: |
Authors have
not verified
information
|
| Artifact Evaluation Badge: |
none
|
| Artifact URLs: |
|
| Artifact Correspondence Email Addresses: |
|
| NSF Award Numbers: |
unknown
|
| DBLP Key: |
conf/soda/BackursIS17
|
| Author Comments: |
|