A PTAS for l_p-Low Rank Approximation

Ban, Frank; Bhattiprolu, Vijay; Bringmann, Karl; Kolev, Pavel; Lee, Euiwoong; Woodruff, David

doi:10.1137/1.9781611975482.47

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

A PTAS for l_p-Low Rank Approximation

MPS-Authors

/persons/resource/persons44182

Bringmann, Karl
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons136381

Kolev, Pavel
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Ban, F., Bhattiprolu, V., Bringmann, K., Kolev, P., Lee, E., & Woodruff, D. (2019). A PTAS for l_p-Low Rank Approximation. In T. M. Chan (Ed.), Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 747-766). Philadelphia, PA: SIAM. doi:10.1137/1.9781611975482.47.

Cite as: https://hdl.handle.net/21.11116/0000-0002-9E0E-E

Abstract

There is no abstract available