| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Bo Han, Pan Hui, V. S. Anil Kumar, Madhav V. Marathe, Jianhua Shao, Aravind Srinivasan |
Mobile Data Offloading through Opportunistic Communications and Social Participation.  |
IEEE Trans. Mob. Comput.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Iyswarya Narayanan, Venkatesh Sarangan, Arunchandar Vasan, Aravind Srinivasan, Anand Sivasubramaniam |
Networking lessons: From computers to water. |
COMSNETS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Christopher L. Barrett, Richard J. Beckman, Keith R. Bisset, Jiangzhuo Chen, Thomas DuBois, Stephen Eubank, V. S. Anil Kumar, Bryan Lewis, Madhav V. Marathe, Aravind Srinivasan, Paula Elaine Stretz |
Optimizing epidemic protection for socially essential workers. |
IHI |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Yossi Azar, Aleksander Madry, Thomas Moscibroda, Debmalya Panigrahi, Aravind Srinivasan |
Maximum bipartite flow in networks with adaptive channel width. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan |
Capacity of wireless networks under SINR interference constraints. |
Wireless Networks |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernhard Haeupler, Barna Saha, Aravind Srinivasan |
New Constructive Aspects of the Lovász Local Lemma. |
J. ACM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas DuBois, Jennifer Golbeck, Aravind Srinivasan |
Network Clustering Approximation Algorithm Using One Pass Black Box Sampling |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Thomas DuBois, Jennifer Golbeck, Aravind Srinivasan |
Predicting Trust and Distrust in Social Networks. |
SocialCom/PASSAT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Guanhong Pei, V. S. Anil Kumar, Srinivasan Parthasarathy 0002, Aravind Srinivasan |
Approximation algorithms for throughput maximization in wireless networks with delay constraints. |
INFOCOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Bo Han, Pan Hui, Aravind Srinivasan |
Mobile data offloading in metropolitan area networks. |
Mobile Computing and Communications Review |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jaroslaw Byrka, MohammadReza Ghodsi, Aravind Srinivasan |
LP-rounding algorithms for facility-location problems |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Barna Saha, Aravind Srinivasan |
A New Approximation Technique for Resource-Allocation Problems |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Bernhard Haeupler, Barna Saha, Aravind Srinivasan |
New Constructive Aspects of the Lovasz Local Lemma |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Jaroslaw Byrka, Aravind Srinivasan, Chaitanya Swamy |
Fault-Tolerant Facility Location: a randomized dependent LP-rounding algorithm |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Aravind Srinivasan |
Concentration of measure for the analysis of randomized algorithms by Devdatt P. Dubhashi and Alessandro Panconesi Cambridge University Press, 2009. |
SIGACT News |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal, Nitish Korula, Viswanath Nagarajan, Aravind Srinivasan |
On k-Column Sparse Packing Programs. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jaroslaw Byrka, Aravind Srinivasan, Chaitanya Swamy |
Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Barna Saha, Aravind Srinivasan |
A New Approximation Technique for Resource-Allocation Problems. |
ICS |
2010 |
DBLP BibTeX RDF |
|
| 1 | Bernhard Haeupler, Barna Saha, Aravind Srinivasan |
New Constructive Aspects of the Lovasz Local Lemma. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan |
Scheduling on Unrelated Machines under Tree-Like Precedence Constraints. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Precedence-constrained scheduling, Approximation algorithms, Randomized algorithms, Job-shop scheduling |
| 1 | V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan |
A unified approach to scheduling on unrelated parallel machines. |
J. ACM |
2009 |
DBLP DOI BibTeX RDF |
scheduling under multiple criteria, Approximation algorithms, randomized rounding |
| 1 | Yossi Azar, Aleksander Madry, Thomas Moscibroda, Debmalya Panigrahi, Aravind Srinivasan |
Maximum Bipartite Flow in Networks with Adaptive Channel Width. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas DuBois, Jennifer Golbeck, Aravind Srinivasan |
Rigorous Probabilistic Trust-Inference with Applications to Clustering. |
Web Intelligence |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Bo Han, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan |
Distributed Strategies for Channel Allocation and Scheduling in Software-Defined Radio Networks. |
INFOCOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Saeed Alaei, Azarakhsh Malekian, Aravind Srinivasan |
On random sampling auctions for digital goods. |
ACM Conference on Electronic Commerce |
2009 |
DBLP DOI BibTeX RDF |
auction, mechanism design, random sampling |
| 1 | Aravind Srinivasan |
A note on the distribution of the number of prime factors of the integers. |
Inf. Process. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta, Aravind Srinivasan, Éva Tardos |
Cost-Sharing Mechanisms for Network Design. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Seungjoon Lee, Bobby Bhattacharjee, Aravind Srinivasan, Samir Khuller |
Efficient and Resilient Backbones for Multihop Wireless Networks. |
IEEE Trans. Mob. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan |
Minimum Weighted Completion Time. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Aravind Srinivasan |
Improved algorithmic versions of the Lovász Local Lemma. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Sriram V. Pemmaraju, Aravind Srinivasan |
The Randomized Coloring Procedure with Symmetry-Breaking. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan |
Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints. |
INFOCOM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Deepti Chafekar, Dave Levin, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan |
Capacity of Asynchronous Random-Access Scheduling in Wireless Networks. |
INFOCOM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Aravind Srinivasan |
Budgeted Allocations in the Full-Information Setting. |
APPROX-RANDOM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Eran Halperin, Guy Kortsarz, Robert Krauthgamer, Aravind Srinivasan, Nan Wang |
Integrality Ratio for Group Steiner Trees and Directed Steiner Trees. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ruggero Morselli, Bobby Bhattacharjee, Michael A. Marsh, Aravind Srinivasan |
Efficient lookup on unstructured topologies. |
IEEE Journal on Selected Areas in Communications |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Vijay Gopalakrishnan, Ruggero Morselli, Bobby Bhattacharjee, Peter J. Keleher, Aravind Srinivasan |
Distributed Ranked Search. |
HiPC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Aravind Srinivasan |
Approximation algorithms for stochastic and risk-averse optimization. |
SODA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Schlegel, Aravind Srinivasan, Maxim Foursa, Manfred Bogen, Rejin Narayanan, David d'Angelo, Géza Haidegger, Istvan Mezgar, Joseph Canou, Damien Sallé, Fabrizio Meo, Jon Agirre Ibarbia, Anja Herrmann Praturlon |
INT-MANUS: Interactive Production Control in a Distributed Environment. |
HCI |
2007 |
DBLP DOI BibTeX RDF |
Production Service Bus (PSB), Smart-Connected-Control Platform (SCCP), Mobile Control System, Advanced Maintenance, Virtual Reality, real-time, Augmented Reality, tracking system, Knowledge Repository |
| 1 | Aravind Srinivasan |
Randomized Algorithms and Probabilistic Analysis in Wireless Networking. |
SAGA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan |
Cross-layer latency minimization in wireless networks with SINR constraints. |
MobiHoc |
2007 |
DBLP DOI BibTeX RDF |
SINR model, end-to-end scheduling, wireless networks, interference, cross-layer design |
| 1 | Rajiv Gandhi, Samir Khuller, Aravind Srinivasan, Nan Wang |
Approximation algorithms for channel allocation problems in broadcast networks. |
Networks |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta, Aravind Srinivasan |
An Improved Approximation Ratio for the Covering Steiner Problem. |
Theory of Computing |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan, Sibylle Zust |
Provable algorithms for parallel generalized sweep scheduling. |
J. Parallel Distrib. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Arunesh Mishra, Vladimir Brik, Suman Banerjee, Aravind Srinivasan, William A. Arbaugh |
Client-driven channel management for wireless LANs. |
Mobile Computing and Communications Review |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Suman Banerjee, Seungjoon Lee, Bobby Bhattacharjee, Aravind Srinivasan |
Resilient multicast using overlays. |
IEEE/ACM Trans. Netw. |
2006 |
DBLP DOI BibTeX RDF |
probabilistic forwarding, networks, protocols, multicast, resilience, overlays |
| 1 | Rajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy 0002, Aravind Srinivasan |
Dependent rounding and its applications to approximation algorithms. |
J. ACM |
2006 |
DBLP DOI BibTeX RDF |
Randomized rounding, broadcast scheduling |
| 1 | Peter Sanders, Aravind Srinivasan, Berthold Vöcking |
Foreword. |
Theory Comput. Syst. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Aravind Srinivasan |
Review of "The Random Projection Method by Santosh Vempala". |
SIGACT News |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan |
An improved approximation algorithm for vertex cover with hard capacities. |
J. Comput. Syst. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Aravind Srinivasan |
An Extension of the Lovász Local Lemma, and its Applications to Integer Programming. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Kalyanmoy Deb, Aravind Srinivasan |
Innovization: innovating design principles through optimization. |
GECCO |
2006 |
DBLP DOI BibTeX RDF |
knowledge discovery, multi-objective optimization, design principles, innovative design |
| 1 | Arunesh Mishra, Vladimir Brik, Suman Banerjee, Aravind Srinivasan, William A. Arbaugh |
A Client-Driven Approach for Channel Management in Wireless LANs. |
INFOCOM |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, William I. Gasarch, Aravind Srinivasan, Andrey Utis |
Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems. |
ISAAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rob Sherwood, Bobby Bhattacharjee, Aravind Srinivasan |
P5: A protocol for scalable anonymous communication. |
Journal of Computer Security |
2005 |
DBLP BibTeX RDF |
|
| 1 | Devdatt P. Dubhashi, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan, Aravind Srinivasan |
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. |
J. Comput. Syst. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | V. S. Anil Kumar, Srinivasan Parthasarathy 0002, Madhav V. Marathe, Aravind Srinivasan, Sibylle Zust |
Provable Algorithms for Parallel Sweep Scheduling on Unstructured Meshes. |
IPDPS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Ruggero Morselli, Bobby Bhattacharjee, Aravind Srinivasan, Michael A. Marsh |
Efficient lookup on unstructured topologies. |
PODC |
2005 |
DBLP DOI BibTeX RDF |
lookup protocols, distributed algorithms, peer-to-peer networks, random walks |
| 1 | V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan |
Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints. |
APPROX-RANDOM |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan |
Approximation Algorithms for Scheduling on Multiple Machines. |
FOCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan |
Algorithmic aspects of capacity in wireless networks. |
SIGMETRICS |
2005 |
DBLP DOI BibTeX RDF |
capacity modeling, end-to-end scheduling, wireless networks, linear programming |
| 1 | Andris Ambainis, William I. Gasarch, Aravind Srinivasan, Andrey Utis |
Lower bounds on the Deterministic and Quantum Communication Complexity of HAMna |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Rajiv Gandhi, Samir Khuller, Aravind Srinivasan |
Approximation algorithms for partial covering problems. |
J. Algorithms |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, William I. Gasarch, Aravind Srinivasan, Andrey Utis |
Lower bounds on the Deterministic and Quantum Communication Complexity of Hamming Distance |
CoRR |
2004 |
DBLP BibTeX RDF |
|
| 1 | Hadas Shachnai, Aravind Srinivasan |
Finding Large Independent Sets in Graphs and Hypergraphs. |
SIAM J. Discrete Math. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeev Khanna, Aravind Srinivasan |
Special issue: 35th Annual ACM Symposium on Theory of Computing. |
J. Comput. Syst. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen Eubank, V. S. Anil Kumar, Madhav V. Marathe, Aravind Srinivasan, Nan Wang |
Structural and algorithmic aspects of massive social networks. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan |
End-to-end packet-scheduling in wireless ad-hoc networks. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Suman Banerjee, Seungjoon Lee, Ryan Braud, Bobby Bhattacharjee, Aravind Srinivasan |
Scalable resilient media streaming. |
NOSSDAV |
2004 |
DBLP DOI BibTeX RDF |
multicast, overlay network, resilience, media streaming |
| 1 | Anupam Gupta, Aravind Srinivasan, Éva Tardos |
Cost-Sharing Mechanisms for Network Design. |
APPROX-RANDOM |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | William I. Gasarch, Evan Golub, Aravind Srinivasan |
When does a random Robin Hood win? |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Aravind Srinivasan |
An Extension of the Lovasz Local Lemma, and its Applications to Integer Programming |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 1 | Aravind Srinivasan |
On the approximability of clique and related maximization problems. |
J. Comput. Syst. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Christopher L. Barrett, Achla Marathe, Madhav V. Marathe, Doug Cook, Gregory Hicks, Vance Faber, Aravind Srinivasan, Yoram J. Sussmann, Heidi Thornquist |
Statistical Analysis of Algorithms: A Case Study of Market-Clearing Mechanisms in the Power Industry. |
J. Graph Algorithms Appl. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Eran Halperin, Guy Kortsarz, Robert Krauthgamer, Aravind Srinivasan, Nan Wang |
Integrality ratio for group Steiner trees and directed steiner trees. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Devdatt P. Dubhashi, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan, Aravind Srinivasan |
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
Ad hoc networks, distributed algorithms, dominating sets |
| 1 | Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan |
An Improved Approximation Algorithm for Vertex Cover with Hard Capacities. |
ICALP |
2003 |
DBLP DOI BibTeX RDF |
capacitated covering, Approximation algorithms, linear programming, set cover, vertex cover, randomized rounding |
| 1 | Rajiv Gandhi, Samir Khuller, Aravind Srinivasan, Nan Wang |
Approximation Algorithms for Channel Allocation Problems in Broadcast Networks. |
RANDOM-APPROX |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta, Aravind Srinivasan |
On the Covering Steiner Problem. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Suman Banerjee, Seungjoon Lee, Bobby Bhattacharjee, Aravind Srinivasan |
Resilient multicast using overlays. |
SIGMETRICS |
2003 |
DBLP DOI BibTeX RDF |
randomized forwarding, resilience, overlay multicast |
| 1 | Goran Konjevod, R. Ravi, Aravind Srinivasan |
Approximation algorithms for the covering Steiner problem. |
Random Struct. Algorithms |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Alberto Caprara, Giuseppe F. Italiano, G. Mohan, Alessandro Panconesi, Aravind Srinivasan |
Wavelength rerouting in optical networks, or the Venetian Routing problem. |
J. Algorithms |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Uriel Feige, Magnús M. Halldórsson, Guy Kortsarz, Aravind Srinivasan |
Approximating the Domatic Number. |
SIAM J. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Rob Sherwood, Bobby Bhattacharjee, Aravind Srinivasan |
P5: A Protocol for Scalable Anonymous Communication. (PDF / PS) |
IEEE Symposium on Security and Privacy |
2002 |
DBLP DOI BibTeX RDF |
security, privacy, network, anonymous |
| 1 | Matthew Andrews, F. Bruce Shepherd, Aravind Srinivasan, Peter Winkler, Francis Zane |
Clustering and Server Selection using Passive Monitoring. |
INFOCOM |
2002 |
DBLP BibTeX RDF |
|
| 1 | Eran Halperin, Aravind Srinivasan |
Improved Approximation Algorithms for the Partial Vertex Cover Problem. |
APPROX |
2002 |
DBLP DOI BibTeX RDF |
Partial vertex cover, approximation algorithms, semidefinite programming, randomized rounding |
| 1 | Rajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy 0002, Aravind Srinivasan |
Dependent Rounding in Bipartite Graphs. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Leslie Ann Goldberg, Mike Paterson, Aravind Srinivasan, Elizabeth Sweedyk |
Better Approximation Guarantees for Job-Shop Scheduling. |
SIAM J. Discrete Math. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Yi Li, Philip M. Long, Aravind Srinivasan |
Improved Bounds on the Sample Complexity of Learning. |
J. Comput. Syst. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank Thomson Leighton, Chi-Jen Lu, Satish Rao, Aravind Srinivasan |
New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning. |
SIAM J. Comput. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Yi Li, Philip M. Long, Aravind Srinivasan |
The one-inclusion graph algorithm is near-optimal for the prediction model of learning. |
IEEE Transactions on Information Theory |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Aravind Srinivasan |
Domatic partitions and the Lovász local lemma. |
SODA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Aravind Srinivasan |
New approaches to covering and packing problems. |
SODA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajiv Gandhi, Samir Khuller, Aravind Srinivasan |
Approximation Algorithms for Partial Covering Problems. |
ICALP |
2001 |
DBLP DOI BibTeX RDF |
Approximation algorithms, set cover, vertex cover, randomized rounding, primal-dual methods, partial covering |
| 1 | Hadas Shachnai, Aravind Srinivasan |
Finding large independent sets of hypergraphs in parallel. |
SPAA |
2001 |
DBLP DOI BibTeX RDF |
parallel algorithms, randomized algorithms, hypergraphs, independent sets |
| 1 | Aravind Srinivasan |
Distributions on Level-Sets with Applications to Approximation Algorithms. |
FOCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Christopher L. Barrett, Doug Cook, Gregory Hicks, Vance Faber, Achla Marathe, Madhav V. Marathe, Aravind Srinivasan, Yoram J. Sussmann, Heidi Thornquist |
Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power Industry. |
Algorithm Engineering |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael E. Saks, Aravind Srinivasan, Shiyu Zhou, David Zuckerman |
Low discrepancy sets yield approximate min-wise independent permutation families. |
Inf. Process. Lett. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Alok Baveja, Aravind Srinivasan |
Approximating low-congestion routing and column-restricted packing problems. |
Inf. Process. Lett. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Auer, Philip M. Long, Aravind Srinivasan |
Approximating Hyper-Rectangles: Learning and Pseudo-random Sets |
Electronic Colloquium on Computational Complexity (ECCC) |
2000 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")