Searching for authors named "Aravind Srinivasan" – sorted by Relevance.
58 documents found, showing 1 through 10.
Next 10 →
-
An Extension of the Lovász Local Lemma, and its Applications to Integer Programming
- …An Extension of the Lov'asz Local Lemma, and its Applications to Integer Programming Aravind…
- Cited by 26 (5 self) – Add To MetaCart
-
Improved Approximation Guarantees for Packing and Covering Integer Programs
- … and Covering Integer Programs 1 by Aravind Srinivasan 2;3 Department of Information Systems and Computer…
- Cited by 25 (2 self) – Add To MetaCart
-
Approximation Algorithms Via Randomized Rounding: A Survey
- …Approximation algorithms via randomized rounding: a survey Aravind Srinivasan Abstract…
- Cited by 10 (1 self) – Add To MetaCart
-
A constant-factor approximation algorithm for packet routing, and balancing local vs. global criteria
- … ∗ ARAVIND SRINIVASAN † AND CHUNG-PIAW TEO ‡ Abstract. We present the first constant-factor approximation…
- Cited by 39 (4 self) – Add To MetaCart
-
Innovization: Innovative Design Principles Through Optimization
- …Innovization: Innovative Design Principles Through Optimization Kalyanmoy Deb and Aravind…
- Cited by 2 (1 self) – Add To MetaCart
-
Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds
- … # ALESSANDRO PANCONESI + AND ARAVIND SRINIVASAN # SIAM J. COMPUT. c # 1997 Society for Industrial…
- Cited by 30 (6 self) – Add To MetaCart
-
An Improved Approximation Ratio for the Covering Steiner Problem. On the Covering Steiner problem
- … Approximation Ratio for the Covering Steiner Problem ∗ Anupam Gupta † Aravind Srinivasan ‡ Received: August 4…
- Cited by 2 (1 self) – Add To MetaCart
-
Contention Resolution with Bounded Delay
- …Contention Resolution with Bounded Delay Mike Paterson y Aravind Srinivasan z Dept…
- Cited by 6 (0 self) – Add To MetaCart
-
On the Covering Steiner Problem
- …On the Covering Steiner Problem ⋆ Anupam Gupta 1 and Aravind Srinivasan 2 1 Department of Computer…
- Cited by 2 (0 self) – Add To MetaCart
-
Computing With Very Weak Random Sources
- …COMPUTING WITH VERY WEAK RANDOM SOURCES ARAVIND SRINIVASAN y AND DAVID ZUCKERMAN z Abstract…
- Cited by 59 (7 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
