Tzu-Chin Lin

According to our database, Tzu-Chin Lin authored at least 7 papers between 2001 and 2009.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2009

Efficient algorithms for the inverse sorting problem with bound constraints under the l_∞-norm and the Hamming distance.

Tzu-Chin Lin, Chung-Chin Kuo, Yong-Hsian Hsieh, Biing-Feng Wang

J. Comput. Syst. Sci., 2009

2008

Improved algorithms for the minmax-regret 1-center and 1-median problems.

Hung-I Yu, Tzu-Chin Lin, Biing-Feng Wang

ACM Trans. Algorithms, 2008

Finding the conditional location of a median path on a tree.

Biing-Feng Wang, Tzu-Chin Lin, Chien-Hsin Lin, Shan-Chyun Ku

Inf. Comput., 2008

2006

Improved Algorithms for the Minmax-Regret 1-Center Problem.

Tzu-Chin Lin, Hung-I Yu, Biing-Feng Wang

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Improved Algorithms for the Minmax Regret 1-Median Problem.

Hung-I Yu, Tzu-Chin Lin, Biing-Feng Wang

Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2002

Efficient Parallel Algorithms for the r-Dominating Set and p-Center Problems on Trees.

Tzu-Chin Lin, Biing-Feng Wang

Proceedings of the 9th International Conference on Parallel and Distributed Systems, 2002

2001

Efficient Algorithms for Two Generalized 2-Median Problems on Trees.

Shan-Chyun Ku, Chi-Jen Lu, Biing-Feng Wang, Tzu-Chin Lin

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001