Showing cs.DSShow all
3 papers · 1 filter
cs.DS2018
A PTAS for -Low Rank Approximation
Frank Ban, Vijay Bhattiprolu, Karl Bringmann +3
A number of recent works have studied algorithms for entrywise -low rank approximation, namely, algorithms which given an matrix (with ), output…
cs.DS2018
Approximating Operator Norms via Generalized Krivine Rounding
Vijay Bhattiprolu, Mrinalkanti Ghosh, Venkatesan Guruswami +2
We consider the -Grothendieck problem, which seeks to maximize the bilinear form for an input matrix over vectors with . The…
cs.DS2015
Approximate Hypergraph Coloring under Low-discrepancy and Related Promises
Vijay V. S. P. Bhattiprolu, Venkatesan Guruswami, Euiwoong Lee
A hypergraph is said to be -colorable if its vertices can be colored with colors so that no hyperedge is monochromatic. -colorability is a fundamental property (called Pr…