Improving the discrepancy bound for sparse matrices: better approximations for sparse lattice approximation problems

Authors:
Aravind Srinivasan
Affiliations:
Department of Information Systems and Computer Science, National University of Singapore, Singapore 119260 and The National University of Singapore and Department of Computer Science, University o ...
Venue:
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Year:
1997

Discrepancy of set-systems and matrices

European Journal of Combinatorics
Efficient parallel algorithms for edge coloring problems

Journal of Algorithms
Probabilistic construction of deterministic algorithms: approximating packing integer programs

Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear

Discrete Mathematics - Topological, algebraical and combinatorial structures; Froli´k's memorial volume
Discrepancy theory

Handbook of combinatorics (vol. 2)

Balanced Coloring: Equally Easy for All Numbers of Colors?

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Multicolour Discrepancies

Combinatorics, Probability and Computing
Matrix rounding and approximation

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Matrix approximation and Tusnády's problem

European Journal of Combinatorics
The entropy rounding method in approximation algorithms

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Bin packing via discrepancy of permutations

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Bin Packing via Discrepancy of Permutations

ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11

Hi-index	0.00