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

Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem.

J. Li, S. Liu, J. Lichen, W. Wang, and Y. Zheng. J. Comb. Optim., 39 (2): 492-508 (2020)

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.

No persons found for author name Lichen, Junran

add a person with the name Lichen, Junran

Other publications of authors with the same name

Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem.J. Li, S. Liu, J. Lichen, W. Wang, and Y. Zheng. J. Comb. Optim., 39 (2): 492-508 (2020)Bin packing with divisible item sizes and rejection penalties.J. Li, P. Pan, L. Cai, J. Lichen, and W. Wang. Optim. Lett., 16 (5): 1587-1597 (2022)Delay-constrained minimum shortest path trees and related problems.J. Lichen, L. Cai, J. Li, S. Liu, P. Pan, and W. Wang. Theor. Comput. Sci., (2023)1-line minimum rectilinear steiner trees and related problems.J. Li, J. Lichen, W. Wang, J. Yeh, Y. Yeh, X. Yu, and Y. Zheng. J. Comb. Optim., 44 (4): 2832-2852 (2022)Approximation algorithms for constructing required subgraphs using stock pieces of fixed length.J. Lichen, J. Li, K. Lih, and X. Yu. J. Comb. Optim., 44 (3): 1774-1795 (2022)Improved approximation algorithms for the combination problem of parallel machine scheduling and path.L. Guan, J. Li, W. Li, and J. Lichen. J. Comb. Optim., 38 (3): 689-697 (2019)Approximation Algorithms for the Generalized Stacker Crane Problem.J. Li, X. Liu, W. Li, L. Guan, and J. Lichen. COCOA (1), volume 10627 of Lecture Notes in Computer Science, page 95-102. Springer, (2017)The Constrained Parallel-Machine Scheduling Problem with Divisible Processing Times and Penalties.J. Li, R. Xie, J. Lichen, G. Hu, P. Pan, and P. Yang. AAIM, volume 13513 of Lecture Notes in Computer Science, page 83-95. Springer, (2022)On Approximations for Constructing 1-Line Minimum Rectilinear Steiner Trees in the Euclidean Plane $R^2$.J. Lichen, J. Li, W. Wang, J. Yeh, Y. Yeh, X. Yu, and Y. Zheng. AAIM, volume 12290 of Lecture Notes in Computer Science, page 49-61. Springer, (2020)The subdivision-constrained routing requests problem.J. Li, W. Li, and J. Lichen. J. Comb. Optim., 27 (1): 152-163 (2014)

BibSonomy

Disambiguation of "Lichen, Junran"

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

Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem.

Please choose a person to relate this publication to

Other publications of authors with the same name

Disambiguation

BibSonomy

Disambiguation of "Lichen, Junran"

copydeleteadd this publication to your clipboardcommunity posthistory of this postURLDOIBibTeXEndNoteAPAChicagoDIN 1505HarvardMSOffice XML Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem.

Please choose a person to relate this publication to

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

Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem.