Author of the publication

A Primal-Dual Approximation Algorithm for the Steiner Forest Problem.

. Inf. Process. Lett., 50 (4): 185-190 (1994)

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

Inventory Routing Problem with Facility Location., and . WADS, volume 11646 of Lecture Notes in Computer Science, page 452-465. Springer, (2019)Line-of-Sight Networks., , , and . Comb. Probab. Comput., 18 (1-2): 145-163 (2009)Approximation Algorithms for Multicommodity Facility Location Problems., and . SIAM J. Discret. Math., 24 (2): 538-551 (2010)Approximating the Single-Sink Link-Installation Problem in Network Design., , , and . SIAM J. Optimization, 11 (3): 595-610 (2001)Stretching the Effectiveness of MLE from Accuracy to Bias for Pairwise Comparisons., , and . AISTATS, volume 108 of Proceedings of Machine Learning Research, page 66-76. PMLR, (2020)Optimal Circuits for Parallel Multipliers., , , and . IEEE Trans. Computers, 47 (3): 273-285 (1998)Improved approximations for two-stage min-cut and shortest path problems under uncertainty., , , , and . Math. Program., 149 (1-2): 167-194 (2015)Redeeming Nested Dissection: Parallelism Implies Fill., , , and . PPSC, (1999)Approximating k-cuts via network strength., and . SODA, page 621-622. ACM/SIAM, (2002)Reconstructing edge-disjoint paths., , and . Oper. Res. Lett., 31 (3): 273-276 (2003)