Author of the publication

Practical Approximation Algorithms for Separable Packing Linear Programs.

, , , , and . WADS, volume 2125 of Lecture Notes in Computer Science, page 325-337. Springer, (2001)

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

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)Engineering a scalable placement heuristic for DNA probe arrays., , , , and . RECOMB, page 148-156. ACM, (2003)Practical Approximation Algorithms for Separable Packing Linear Programs., , , , and . WADS, volume 2125 of Lecture Notes in Computer Science, page 325-337. Springer, (2001)Improved Steiner tree approximation in graphs., and . SODA, page 770-779. ACM/SIAM, (2000)An approximation algorithm for weighted itk-polymatroids and the Steiner tree problem in graphs.. IPCO, page 89-98. CIACO, (1993)The moving-target traveling salesman problem., , and . J. Algorithms, 49 (1): 153-174 (2003)Bottleneck Steiner Tree Problems.. Encyclopedia of Optimization, Springer, (2009)Genotype Tagging with Limited Overfitting., and . BSB, volume 5676 of Lecture Notes in Computer Science, page 1-12. Springer, (2009)Design and Validation of Methods Searching for Risk Factors in Genotype Case-Control Studies., and . J. Comput. Biol., 15 (1): 81-90 (2008)Tighter Bounds for Graph Steiner Tree Approximation., and . SIAM J. Discret. Math., 19 (1): 122-134 (2005)