Research output

1. Polynomial-Time Approximability of the Asymmetric Problem of Covering a Graph by a Bounded Number of Cycles

   Research output: Contribution to journal › Article › peer-review

2. Prize-Collecting Asymmetric Traveling Salesman Problem Admits Polynomial Time Approximation Within a Constant Ratio: book chapter

   Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

3. Approximation Algorithms with Constant Factors for a Series of Asymmetric Routing Problems

   Research output: Contribution to journal › Article › peer-review

View all (94) »