From post

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.

 

Другие публикации лиц с тем же именем

An approximation algorithm for weighted itk-polymatroids and the Steiner tree problem in graphs.. IPCO, стр. 89-98. CIACO, (1993)A Factor 3/2 Approximation for Generalized Steiner Tree Problem with Distances One and Two, , и . CoRR, (2008)A New Approximation Algorithm for Finding Heavy Planar Subgraphs., , , и . Algorithmica, 36 (2): 179-205 (2003)Engineering a scalable placement heuristic for DNA probe arrays., , , , и . RECOMB, стр. 148-156. ACM, (2003)The T-join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout., , , и . WADS, том 1663 из Lecture Notes in Computer Science, стр. 25-36. Springer, (1999)Practical Approximation Algorithms for Separable Packing Linear Programs., , , , и . WADS, том 2125 из Lecture Notes in Computer Science, стр. 325-337. Springer, (2001)The associative-skew clock routing problem., , , и . ICCAD, стр. 168-172. IEEE Computer Society, (1999)Fast Alignments of Metabolic Networks., , , и . BIBM, стр. 147-152. IEEE Computer Society, (2008)An SVM Based Approach to Study the Racial Disparity in Triple-Negative Breast Cancer., , и . ICCABS, том 13254 из Lecture Notes in Computer Science, стр. 163-175. Springer International Publishing, (2021)Improved Steiner tree approximation in graphs., и . SODA, стр. 770-779. ACM/SIAM, (2000)