( en | de | ru )

 

Disambiguation of "Berman, Piotr"

Author of the publication

copydeleteadd this publication to your clipboard
A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2.

, , and . ISAAC (1), volume 6506 of Lecture Notes in Computer Science, page 15-24. Springer, (2010)

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.

Nina Berman

Judith Berman

Leo Berman

Jakob Berman

David Berman

 

Other publications of authors with the same name

Approximating Maximum Independent Set in Bounded Degree Graphs., and . SODA, page 365-371. ACM/SIAM, (1994)Improving the performance of k-means clustering through computation skipping and data locality optimizations., , and . Conf. Computing Frontiers, page 273-276. ACM, (2012)Approximating Transitivity in Directed Networks, , and . CoRR, (2008)Complexities of Efficient Solutions of Rectilinear Polygon Cover Problems., and . Algorithmica, 17 (4): 331-356 (1997)Improved approximation algorithms for rectangle tiling and packing., , , and . SODA, page 427-436. ACM/SIAM, (2001)Simple approximation algorithm for nonoverlapping local alignments., , and . SODA, page 677-678. ACM/SIAM, (2002)On-line Load Balancing for Related Machines., , and . WADS, volume 1272 of Lecture Notes in Computer Science, page 116-125. Springer, (1997)Towards Optimal Distributed Consensus (Extended Abstract), , and . FOCS, page 410-415. IEEE Computer Society, (1989)Aligning Two Fragmented Sequences., , and . IPDPS, IEEE Computer Society, (2002)On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts., , , , and . CPM, volume 1264 of Lecture Notes in Computer Science, page 40-51. Springer, (1997)