( en | de | ru )

 

Disambiguation of "Halperin, Eran"

Author of the publication

copydeleteadd this publication to your clipboard
Integrality ratio for group Steiner trees and directed steiner trees.

, , , , and . SODA, page 275-284. ACM/SIAM, (2003)

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.

Emre Eran

Asl han Eran

Hasan Gündüz Eran

Eran Gündüz

Charles Halperin

 

Other publications of authors with the same name

A stochastic process on the hypercube with applications to peer-to-peer networks., , , and . STOC, page 575-584. ACM, (2003)Combinatorial approximation algorithms for the maximum directed cut problem., and . SODA, page 1-7. ACM/SIAM, (2001)Haplotype Inference in Complex Pedigrees., , , and . RECOMB, volume 5541 of Lecture Notes in Computer Science, page 108-120. Springer, (2009)Fast lossless compression via cascading Bloom filters., , and . BMC Bioinform., 15 (S-9): S7 (2014)Using Stochastic Approximation Techniques to Efficiently Construct Confidence Intervals for Heritability., , , , , and . RECOMB, volume 10229 of Lecture Notes in Computer Science, page 241-256. (2017)Recycler: an algorithm for detecting plasmids from de novo assembly graphs., , , , , , and . Bioinform., 33 (4): 475-482 (2017)Integrality ratio for group Steiner trees and directed steiner trees., , , , and . SODA, page 275-284. ACM/SIAM, (2003)Reachability and distance queries via 2-hop labels., , , and . SODA, page 937-946. ACM/SIAM, (2002)Asymmetric k-center is log* n-hard to approximate., , , , , and . STOC, page 21-27. ACM, (2004)Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs., and . IPCO, volume 1610 of Lecture Notes in Computer Science, page 202-217. Springer, (1999)