Yen Hung Chen

According to our database, Yen Hung Chen authored at least 19 papers between 2003 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2022

The Clustered Selected-Internal Steiner Tree Problem.

Yen Hung Chen

Int. J. Found. Comput. Sci., 2022

Approximability results for the $p$-centdian and the converse centdian problems.

Yen Hung Chen

Discret. Math. Theor. Comput. Sci., 2022

2020

Approximating the clustered selected-internal Steiner tree problem.

Yen Hung Chen

CoRR, 2020

2018

A Measure and Conquer Algorithm for the Minimum User Spatial-Aware Interest Group Query Problem.

Chih-Yang Huang, Po-Chuan Chien, Yen Hung Chen

Proceedings of the New Trends in Computer Technologies and Applications, 2018

2016

The bottleneck selected-internal and partial terminal Steiner tree problems.

Yen Hung Chen

Networks, 2016

Approximability results for the converse connected p-centre problem.

Yen Hung Chen

Int. J. Comput. Math., 2016

2014

The Dominated Coloring Problem and Its Application.

Yen Hung Chen

Proceedings of the Computational Science and Its Applications - ICCSA 2014 - 14th International Conference, Guimarães, Portugal, June 30, 2014

2012

The <i>k</i> Partition-Distance Problem.

Yen Hung Chen

J. Comput. Biol., 2012

Polynomial Time Approximation Schemes for the Constrained Minimum Spanning Tree Problem.

Yen Hung Chen

J. Appl. Math., 2012

Approximation Hardness of the Mixed Dominating Set Problem.

Yen Hung Chen

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011

An Improved Approximation Algorithm for the Terminal Steiner Tree Problem.

Yen Hung Chen

Proceedings of the Computational Science and Its Applications - ICCSA 2011, 2011

2010

On the bottleneck tree alignment problems.

Yen Hung Chen, Chuan Yi Tang

Inf. Sci., 2010

2009

Optimal economic production quantity policy for imperfect process with imperfect repair and maintenance.

Gwo-Liang Liao, Yen Hung Chen, Shey-Huei Sheu

Eur. J. Oper. Res., 2009

A Fast Approximation Algorithm for the <i>k</i> Partition-Distance Problem.

Yen Hung Chen

Proceedings of the Computational Science and Its Applications, 2009

2007

Approximation Algorithms for 2-Source Minimum Routing Cost <i>k</i> -Tree Problems.

Yen Hung Chen, Gwo-Liang Liao, Chuan Yi Tang

Proceedings of the Computational Science and Its Applications, 2007

2006

Approximation algorithms for some <i>k</i>-source shortest paths spanning tree problems.

Yen Hung Chen, Bang Ye Wu, Chuan Yi Tang

Networks, 2006

2005

Disjoint Segments with Maximum Density.

Yen Hung Chen, Hsueh-I Lu, Chuan Yi Tang

Proceedings of the Computational Science, 2005

2004

Approximation Algorithms for k-Source Bottleneck Routing Cost Spanning Tree Problems.

Yen Hung Chen, Bang Ye Wu, Chuan Yi Tang

Proceedings of the Computational Science and Its Applications, 2004

2003

On the Full and Bottleneck Full Steiner Tree Problems.

Yen Hung Chen, Chin Lung Lu, Chuan Yi Tang

Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003