Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Yen Hung Chen
2010 – today
- 2012
[j5]Yen Hung Chen: Polynomial Time Approximation Schemes for the Constrained Minimum Spanning Tree Problem. J. Applied Mathematics 2012 (2012)- [j4]Yen Hung Chen: The k Partition-Distance Problem. Journal of Computational Biology 19(4): 404-417 (2012)
- [c8]
- 2011
- [c7]Yen Hung Chen: An Improved Approximation Algorithm for the Terminal Steiner Tree Problem. ICCSA (3) 2011: 141-151
- 2010
- [j3]Yen Hung Chen, Chuan Yi Tang: On the bottleneck tree alignment problems. Inf. Sci. 180(11): 2134-2141 (2010)
2000 – 2009
- 2009
- [j2]Gwo-Liang Liao, Yen Hung Chen, Shey-Huei Sheu: Optimal economic production quantity policy for imperfect process with imperfect repair and maintenance. European Journal of Operational Research 195(2): 348-357 (2009)
- [c6]Yen Hung Chen: A Fast Approximation Algorithm for the k Partition-Distance Problem. ICCSA (2) 2009: 537-546
- 2007
- [c5]Yen Hung Chen, Gwo-Liang Liao, Chuan Yi Tang: Approximation Algorithms for 2-Source Minimum Routing Cost k -Tree Problems. ICCSA (3) 2007: 520-533
- 2006
- [j1]Yen Hung Chen, Bang Ye Wu, Chuan Yi Tang: Approximation algorithms for some k-source shortest paths spanning tree problems. Networks 47(3): 147-156 (2006)
- [c4]
- 2005
- [c3]Yen Hung Chen, Hsueh-I Lu, Chuan Yi Tang: Disjoint Segments with Maximum Density. International Conference on Computational Science (2) 2005: 845-850
- 2004
- [c2]Yen Hung Chen, Bang Ye Wu, Chuan Yi Tang: Approximation Algorithms for k-Source Bottleneck Routing Cost Spanning Tree Problems. ICCSA (3) 2004: 355-366
- 2003
- [c1]Yen Hung Chen, Chin Lung Lu, Chuan Yi Tang: On the Full and Bottleneck Full Steiner Tree Problems. COCOON 2003: 122-129
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-17 21:53 CEST by the dblp team