From post

Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems.

, , и . ISAAC, том 4288 из Lecture Notes in Computer Science, стр. 567-577. Springer, (2006)

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.

 

Другие публикации лиц с тем же именем

Minimum Spanning Tree with Neighborhoods., , , и . AAIM, том 4508 из Lecture Notes in Computer Science, стр. 306-316. Springer, (2007)Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems., , и . ISAAC, том 4288 из Lecture Notes in Computer Science, стр. 567-577. Springer, (2006)Motion Tracking and Intensity Surface Recovery in Microscopic Nuclear Images., , , и . MICCAI, том 3749 из Lecture Notes in Computer Science, стр. 876-884. Springer, (2005)On Lazy Bin Covering and Packing problems., , и . Theor. Comput. Sci., 411 (1): 277-284 (2010)Surface approximation based image simplification and applications., , , и . SMC (3), стр. 2988-2993. IEEE, (2004)Graph bandwidth of weighted caterpillars., , и . Theor. Comput. Sci., 363 (3): 266-277 (2006)Graph Bandwidth of Weighted Caterpillars., , и . AAIM, том 3521 из Lecture Notes in Computer Science, стр. 370-380. Springer, (2005)On Lazy Bin Covering and Packing Problems., , и . COCOON, том 4112 из Lecture Notes in Computer Science, стр. 340-349. Springer, (2006)Almost Optimal Solutions for Bin Coloring Problems., , и . ISAAC, том 3827 из Lecture Notes in Computer Science, стр. 82-91. Springer, (2005)Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems., , и . Algorithmica, 57 (2): 232-251 (2010)