Yen Hung Chen

is this you? claim profile

Approximating the clustered selected-internal Steiner tree problem

Given a complete graph G=(V,E), with nonnegative edge costs, two subsets...
10/30/2020 ∙ by Yen Hung Chen, et al. ∙ 0 ∙ share

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

Given an undirected graph G=(V,E,l) with a nonnegative edge length funct...
10/30/2020 ∙ by Yen Hung Chen, et al. ∙ 0 ∙ share

read it