Author of the publication

1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two.

, , and . Electron. Colloquium Comput. Complex., (2008)

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

Improved Steiner tree approximation in graphs., and . SODA, page 770-779. ACM/SIAM, (2000)The T-join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout., , , and . WADS, volume 1663 of Lecture Notes in Computer Science, page 25-36. Springer, (1999)Practical Approximation Algorithms for Separable Packing Linear Programs., , , , and . WADS, volume 2125 of Lecture Notes in Computer Science, page 325-337. Springer, (2001)Engineering a scalable placement heuristic for DNA probe arrays., , , , and . RECOMB, page 148-156. ACM, (2003)2SNP: Scalable Phasing Method for Trios and Unrelated Individuals., and . IEEE ACM Trans. Comput. Biol. Bioinform., 5 (2): 313-318 (2008)Computer-Aided Optimization of DNA Array Design and Manufacturing., , , , and . IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 25 (2): 305-320 (2006)Optimal phase conflict removal for layout of dark field alternating phase shifting masks., , , , and . ISPD, page 121-126. ACM, (1999)The associative-skew clock routing problem., , , and . ICCAD, page 168-172. IEEE Computer Society, (1999)Fast Alignments of Metabolic Networks., , , and . BIBM, page 147-152. IEEE Computer Society, (2008)Bottleneck Steiner Tree Problems.. Encyclopedia of Optimization, Springer, (2009)