Ching-Lueh Chang

activity

20072022

most citedOn irreversible dynamic monopolies in general graphs

17 citations · 25 across the 11 of their papers we have counts for

collaborators

Showing 2015Show all

2 papers · 1 filter

cs.CC2015

Metric $1$ -median selection: Query complexity vs. approximation ratio

Ching-Lueh Chang

Consider the problem of finding a point in a metric space $({1, 2, \dots, n}, d)$ with the minimum average distance to other points. We show that this problem has no deterministic $…

cs.DS2015★ 2 cited

A deterministic sublinear-time nonadaptive algorithm for metric $1$ -median selection

Ching-Lueh Chang

We give a deterministic $O (h n^{1 + 1/ h})$ -time $(2 h)$ -approximation nonadaptive algorithm for $1$ -median selection in $n$ -point metric spaces, where $h \in Z^{+} ∖ {1}$ …

Metric 1-median selection: Query complexity vs. approximation ratio

A deterministic sublinear-time nonadaptive algorithm for metric 1-median selection

Metric $1$ -median selection: Query complexity vs. approximation ratio

A deterministic sublinear-time nonadaptive algorithm for metric $1$ -median selection