Author of the publication

Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks.

, , and . Discret. Appl. Math., 155 (6-7): 733-749 (2007)

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.

 

Other publications of authors with the same name

On the Computational Complexity of Measuring Global Stability of Banking Networks., , , and . Algorithmica, 70 (4): 595-647 (2014)Effect of Gromov-Hyperbolicity Parameter on Cuts and Expansions in Graphs and Some Algorithmic Implications., , , and . Algorithmica, 80 (2): 772-800 (2018)On analyzing and evaluating privacy measures for social networks under active attack., , and . CoRR, (2018)On the complexity and approximation of syntenic distance., , , , and . RECOMB, page 99-108. ACM, (1997)Tight Approximability Results for Test Set Problems in Bioinformatics., , and . SWAT, volume 3111 of Lecture Notes in Computer Science, page 39-50. Springer, (2004)On partisan bias in redistricting: computational complexity meets the science of gerrymandering., and . CoRR, (2019)Cooperative motion planning of redundant rover manipulators on uneven terrains., , and . ICAR, page 99-105. IEEE, (2017)Algorithmic and complexity results for decompositions of biological networks into monotone subsystems., , , and . Biosyst., 90 (1): 161-178 (2007)A comparative study of Dirichlet and Neumann conditions for path planning through harmonic functions., , and . Future Gener. Comput. Syst., 20 (3): 441-452 (2004)Sample complexity for learning recurrent perceptron mappings., and . IEEE Trans. Inf. Theory, 42 (5): 1479-1487 (1996)