Author of the publication

Approximation Schemes for Packing Splittable Items with Cardinality Constraints.

, , and . Algorithmica, 62 (1-2): 102-129 (2012)

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

Minimum spanning tree with hop restrictions., and . J. Algorithms, 48 (1): 220-238 (2003)Better bounds for minimizing SONET ADMs., and . J. Comput. Syst. Sci., 75 (2): 122-136 (2009)Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search.. SIAM J. Discrete Math., 23 (1): 251-264 (2008)On the sum minimization version of the online bin covering problem., , , and . Discrete Applied Mathematics, 158 (13): 1381-1393 (2010)Approximation Schemes for Packing Splittable Items with Cardinality Constraints., , and . Algorithmica, 62 (1-2): 102-129 (2012)How to allocate review tasks for robust ranking., and . Acta Inf., 47 (5-6): 325-345 (2010)Robust Approximation Schemes for Cube Packing., and . SIAM Journal on Optimization, 23 (2): 1310-1343 (2013)Lexicographic local search and the p., , and . European Journal of Operational Research, 151 (2): 265-279 (2003)The constrained minimum weighted sum of job completion times problem., and . Math. Program., 108 (1): 115-126 (2006)Min-max cover of a graph with a small number of parts., and . Discrete Optimization, (2015)