Computer Science – Computational Complexity
Scientist
Computer Science
Computational Complexity
Scientist
1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two
A Factor 3/2 Approximation for Generalized Steiner Tree Problem with Distances One and Two
Approximating the Online Set Multicover Problems Via Randomized Winnowing
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems with Applications
On Approximating Four Covering and Packing Problems
No associations
LandOfFree
Piotr Berman does not yet have a rating. At this time, there are no reviews or comments for this scientist.
If you have personal experience with Piotr Berman, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Piotr Berman will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-P-108660