Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

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

M. Lin, Y. Yang, and J. Xu. Algorithmica, 57 (2): 232-251 (2010)

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.

Lin Lin

Other publications of authors with the same name

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

BibSonomy

Disambiguation of "Lin, Mingen"

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

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

Please choose a person to relate this publication to

Lin Lin

Lin Lin

Lin Lin

Lin Lin

Lin Lin

Other publications of authors with the same name

Disambiguation

BibSonomy

Disambiguation of "Lin, Mingen"

copydeleteadd this publication to your clipboardcommunity posthistory of this postURLDOIBibTeXEndNoteAPAChicagoDIN 1505HarvardMSOffice XML Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems.

Please choose a person to relate this publication to

Lin Lin

Lin Lin

Lin Lin

Lin Lin

Lin Lin

Other publications of authors with the same name

Disambiguation

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

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