( en | de | ru )

 

Disambiguation of "Srivastav, Anand"

Author of the publication

copydeleteadd this publication to your clipboard
Randomized Approximation for the Set Multicover Problem in Hypergraphs.

, , and . Algorithmica, 74 (2): 574-588 (2016)

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.

Anand Srivastav

Abhinav Srivastav

Shiela Srivastav

Davinder Kumar Anand

Amar Frank Anand

 

Other publications of authors with the same name

Discrepancy of Cartesian Products of Arithmetic Progressions., , and . Electron. J. Comb., (2004)Improved Approximation Algorithms for Maximum Graph Partitioning Problems., and . J. Comb. Optim., 10 (2): 133-167 (2005)Randomized Approximation for the Set Multicover Problem in Hypergraphs., , and . Algorithmica, 74 (2): 574-588 (2016)A new bound for the Maker-Breaker triangle game., and . Eur. J. Comb., (2022)Finding Dense Subgraphs with Semidefinite Programming., and . APPROX, volume 1444 of Lecture Notes in Computer Science, page 181-191. Springer, (1998)Multicolour Discrepancies., and . Comb. Probab. Comput., 12 (4): 365-399 (2003)An improved filtering algorithm for big read datasets and its application to single-cell assembly., , , , , and . BMC Bioinform., 18 (1): 324 (2017)Tight Approximations for Resource Constrained Scheduling and Bin Packing., and . Discret. Appl. Math., 79 (1-3): 223-245 (1997)On Complexity, Representation and Approximation of Integral Multicommodity Flows., and . Discret. Appl. Math., 99 (1-3): 183-208 (2000)A novel Hybrid Multi-objective Evolutionary Algorithm for the bi-Objective Minimum Diameter-Cost Spanning Tree (bi-MDCST) problem., , and . Eng. Appl. Artif. Intell., (2020)