Searching for authors named "Piotr Berman" – sorted by Relevance.
-
On Approximation of the Power-p and Bottleneck Steiner Trees
- On Approximation of the Power-p and Bottleneck Steiner Trees Piotr Berman Alexander Zelikovsky
- Add To MetaCart
-
Randomized Navigation to a Wall through Convex Obstacles
- Randomized Navigation to a Wall through Convex Obstacles Piotr Berman Marek Karpinski y
- Add To MetaCart
-
Improved Approximations for General Minimum Cost Scheduling
- Improved Approximations for General Minimum Cost Scheduling Piotr Berman Marek Karpinski y
- Add To MetaCart
-
Complexities of Efficient Solutions of Rectilinear Polygon Cover Problems
- Complexities of Efficient Solutions of Rectilinear Polygon Cover Problems 1 Piotr Berman
- Cited by 9 (1 self) – Add To MetaCart
-
Simple Approximation Algorithm for Nonoverlapping Local Alignments
- Simple Approximation Algorithm for Nonoverlapping Local Alignments Piotr Berman Bhaskar Das
- Cited by 4 (1 self) – Add To MetaCart
-
On Some Tighter Inapproximability Results, Further Improvements
- On Some Tighter Inapproximability Results, Further Improvements Piotr Berman y Marek Karpinski
- Cited by 15 (2 self) – Add To MetaCart
-
Aligning Two Fragmented Sequences
- Aligning Two Fragmented Sequences Vamsi Veeramachaneni Piotr Berman Dept. of Computer Science
- Cited by 2 (0 self) – Add To MetaCart
-
Slice and Dice: A Simple, Improved Approximate Tiling Recipe
- Slice and Dice : A Simple, Improved Approximate Tiling Recipe Piotr Berman Bhaskar DasGupta y
- Cited by 4 (2 self) – Add To MetaCart
-
Approximating the Online Set Multicover Problems Via Randomized Winnowing, to appear
- Approximating the Online Set Multicover Problems Via Randomized Winnowing Piotr Berman 1
- Cited by 1 (1 self) – Add To MetaCart
-
Approximation Algorithms for MAX-MIN Tiling
- Approximation Algorithms For MAX-MIN Tiling Piotr Berman y Bhaskar DasGupta z S
- Cited by 2 (1 self) – Add To MetaCart

