3 citations · 5 across the 4 of their papers we have counts for
4 papers
A Cubic-Time 2-Approximation Algorithm for rSPR Distance
Zhi-Zhong Chen, Eita Machida, Lusheng Wang
Due to hybridization events in evolution, studying two different genes of a set of species may yield two related but different phylogenetic trees for the set of species. In this ca…
Approximation algorithms for the maximum weight internal spanning tree problem
Zhi-Zhong Chen, Guohui Lin, Lusheng Wang +2
Given a vertex-weighted connected graph , the maximum weight internal spanning tree (MwIST for short) problem asks for a spanning tree of such that the total we…
An Approximation Algorithm for Maximum Internal Spanning Tree
Zhi-Zhong Chen, Youta Harada, Lusheng Wang
Given a graph G, the {\em maximum internal spanning tree problem} (MIST for short) asks for computing a spanning tree T of G such that the number of internal vertices in T is maxim…
An approximation algorithm for the Bandpass-2 problem
Weitian Tong, Zhi-Zhong Chen, Lusheng Wang +4
The general Bandpass- problem is NP-hard and can be approximated by a reduction into the weighted -set packing problem, with a worst case performance ratio of . When…