1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.CC2008★ 1 cited
1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two
Piotr Berman, Marek Karpinski, Alex Zelikovsky
We give a 1.25 approximation algorithm for the Steiner Tree Problem with distances one and two, improving on the best known bound for that problem.
cs.CC2008
Approximating Transitivity in Directed Networks
Piotr Berman, Bhaskar DasGupta, Marek Karpinski
We study the problem of computing a minimum equivalent digraph (also known as the problem of computing a strong transitive reduction) and its maximum objective function variant, wi…
q-bio.MN2007
On Cycles in the Transcription Network of Saccharomyces cerevisiae
Jieun Jeong
We investigate the cycles in the transcription network of S. cerevisiae. Unlike a similar network of E. coli, it contains many cycles. We characterize properties of these cycles an…