Author of the publication

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.

 

Other publications of authors with the same name

Improving the performance of k-means clustering through computation skipping and data locality optimizations., , and . Conf. Computing Frontiers, page 273-276. ACM, (2012)Approximating Maximum Independent Set in Bounded Degree Graphs., and . SODA, page 365-371. ACM/SIAM, (1994)Approximating Transitivity in Directed Networks, , and . CoRR, (2008)Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems., , and . COCOON, volume 6196 of Lecture Notes in Computer Science, page 226-234. Springer, (2010)The Power and Limitations of Uniform Samples in Testing Properties of Figures., , and . Algorithmica, 81 (3): 1247-1266 (2019)Asymptotically Optimal Distributed Consensus (Extended Abstract)., and . ICALP, volume 372 of Lecture Notes in Computer Science, page 80-94. Springer, (1989)HCV Quasispecies Assembly Using Network Flows., , , , , and . ISBRA, volume 4983 of Lecture Notes in Computer Science, page 159-170. Springer, (2008)A Linear-Time Algorithm for Studying Genetic Variation., and . WABI, volume 4175 of Lecture Notes in Computer Science, page 344-354. Springer, (2006)Randomized Distributed Agreement Revisited., and . FTCS, page 412-419. IEEE Computer Society, (1993)Complexities of Efficient Solutions of Rectilinear Polygon Cover Problems., and . Algorithmica, 17 (4): 331-356 (1997)