PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Srinivasan, Aravind"

Author of the publication

copydeleteadd this publication to your clipboard
Efficient algorithms for location and sizing problems in network design.

, , , , and . GLOBECOM, page 2586-2590. IEEE, (2001)

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.

Prashanth Srinivasan University of Stuttgart

 

Other publications of authors with the same name

Approximation algorithms for the covering Steiner problem., , and . Random Struct. Algorithms, 20 (3): 465-482 (2002)Approximating low-congestion routing and column-restricted packing problems., and . Inf. Process. Lett., 74 (1-2): 19-25 (2000)Chernoff-Hoeffding Bounds for Applications with Limited Independence., , and . SIAM J. Discrete Math., 8 (2): 223-250 (1995)Better Approximation Guarantees for Job-Shop Scheduling., , , and . SIAM J. Discrete Math., 14 (1): 67-92 (2001)An Extension of the Lovász Local Lemma, and its Applications to Integer Programming.. SIAM J. Comput., 36 (3): 609-634 (2006)Efficient algorithms for location and sizing problems in network design., , , , and . GLOBECOM, page 2586-2590. IEEE, (2001)Improved algorithmic versions of the Lovász Local Lemma.. SODA, page 611-620. SIAM, (2008)Improving the Discrepancy Bound for Sparse Matrices: Better Approximations for Sparse Lattice Approximation Problems.. SODA, page 692-701. ACM/SIAM, (1997)Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons., , , , and . SODA, page 717-724. ACM/SIAM, (2003)Contention Resolution with Bounded Delay., and . FOCS, page 104-113. IEEE Computer Society, (1995)