Author of the publication

Improving the Discrepancy Bound for Sparse Matrices: Better Approximations for Sparse Lattice Approximation Problems.

. SODA, page 692-701. ACM/SIAM, (1997)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Attenuate Locally, Win Globally: An Attenuation-based Framework for Online Stochastic Matching with Timeouts., , , and . AAMAS, page 1223-1231. ACM, (2017)New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning., , and . SODA, page 643-652. ACM/SIAM, (1999)An Improved Approximation Ratio for the Covering Steiner Problem., and . Theory Comput., 2 (3): 53-64 (2006)Efficient Algorithms for the Minimum Weighted Dominating Clique Problem on Permutation Graphs., and . Theor. Comput. Sci., 91 (1): 1-21 (1991)Mechanism design for intellectual property rights protection., and . ICIS, page 448. Association for Information Systems, (1997)Improved approximations of packing and covering problems.. STOC, page 268-276. ACM, (1995)Improved Distributed Algorithms for Coloring and Network Decomposition Problems, and . STOC, page 581-592. ACM, (1992)Probability and Computing.. SIGACT News, 49 (3): 20-22 (2018)Low-Bandwidth Routing and Electrical Power Networks., , , , and . ICALP, volume 1443 of Lecture Notes in Computer Science, page 604-615. Springer, (1998)Innovization: Discovery of Innovative Design Principles Through Multiobjective Evolutionary Optimization., and . Multiobjective Problem Solving from Nature, Springer, (2008)