Yen-Hung Chen

collaborators

2 papers

math.CO2020

The clustered selected-internal Steiner tree problem

Yen Hung Chen

Given a complete graph $G = (V, E)$ , with nonnegative edge costs, two subsets $R \subset V$ and $R^{'} \subset R$ , a partition $R = {R_{1}, R_{2}, \dots, R_{k}}$ of $R$ , $R_i \…

math.CO2020

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

Yen Hung Chen

Given an undirected graph $G = (V, E)$ with a nonnegative edge length function and an integer $p$ , $0 < p < ∣ V ∣$ , the $p$ -centdian problem is to find $p$ vertices (called the {\it cen…

The clustered selected-internal Steiner tree problem

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

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