Author of the publication

Approximability of Packing Disjoint Cycles.

, and . ISAAC, volume 4835 of Lecture Notes in Computer Science, page 304-315. Springer, (2007)

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

Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension., and . CoRR, (2021)Frequency Channel Assignment on Planar Networks., and . ESA, volume 2461 of Lecture Notes in Computer Science, page 736-747. Springer, (2002)A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs., and . Algorithmica, 62 (3-4): 1050-1072 (2012)Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median., , , and . Algorithmica, 81 (3): 1006-1030 (2019)Survivable network design with degree or order constraints., , , and . STOC, page 651-660. ACM, (2007)Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k, 2)-Subgraph., and . ISAAC, volume 7074 of Lecture Notes in Computer Science, page 20-29. Springer, (2011)Selecting Genes with Dissimilar Discrimination Strength for Sample Class Prediction., , , , , and . APBC, volume 5 of Advances in Bioinformatics and Computational Biology, page 81-90. Imperial College Press, (2007)Special Issue on Algorithms and Data Structures (WADS 2019)., , and . Algorithmica, 83 (3): 775 (2021)Approximation algorithms for node-weighted buy-at-bulk network design., , , and . SODA, page 1265-1274. SIAM, (2007)A Constant Factor Approximation for Minimum lambda-Edge-Connected k-Subgraph with Metric Costs., and . APPROX-RANDOM, volume 5171 of Lecture Notes in Computer Science, page 233-246. Springer, (2008)