( en | de | ru )

 

Disambiguation of "Srinivasan, Aravind"

Author of the publication

copydeleteadd this publication to your clipboard
Approximation algorithms for the covering Steiner problem.

, , and . Random Struct. Algorithms, 20 (3): 465-482 (2002)

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.

Aravind Sekhar

Aravind Pasula

Aravind Bedekar

Aravind Sundaresan

Aravind Kalaiah

 

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)Innovization: Discovery of Innovative Design Principles Through Multiobjective Evolutionary Optimization., and . Multiobjective Problem Solving from Nature, Springer, (2008)Vertex-weighted Online Stochastic Matching with Patience Constraints., , and . CoRR, (2019)Allocation Problems in Ride-Sharing Platforms: Online Matching with Offline Reusable Resources., , , and . CoRR, (2017)Mix and Match: Markov Chains & Mixing Times for Matching in Rideshare., , , , , and . CoRR, (2019)Finding Large Independent Sets in Graphs and Hypergraphs., and . SIAM J. Discret. Math., 18 (3): 488-500 (2004)Improved Approximation Guarantees for Packing and Covering Integer Programs.. SIAM J. Comput., 29 (2): 648-670 (1999)The Local Natur of Delta-Coloring and its Algorithmic Applications., and . Combinatorica, 15 (2): 255-280 (1995)On the Complexity of Distributed Network Decomposition., and . J. Algorithms, 20 (2): 356-374 (1996)