Bang Ye Wu

Bang Ye Wu: A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem. Algorithmica 65(2): 467-479 (2013)

An-Chiang Chu, Bang Ye Wu, Kun-Mao Chao: A linear-time algorithm for finding an edge-partition with max-min ratio at most two. Discrete Applied Mathematics 161(7-8): 932-943 (2013)

Bang Ye Wu, Li-Hsuan Chen: Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions. CoRR abs/1303.6867 (2013)

Bang Ye Wu: On the maximum disjoint paths problem on edge-colored graphs. Discrete Optimization 9(1): 50-57 (2012)

Bang Ye Wu: Fully Polynomial-Time Approximation Schemes for the Max-Min Connected Partition Problem on Interval Graphs. Discrete Math., Alg. and Appl. 4(1) (2012)

Bang Ye Wu, Jun-Lin Guo, Yue-Li Wang: A linear time algorithm for the next-to-shortest path problem on undirected graphs with nonnegative edge lengths. CoRR abs/1203.5235 (2012)

Bang Ye Wu: A note on approximating the min-max vertex disjoint paths on directed acyclic graphs. J. Comput. Syst. Sci. 77(6): 1054-1057 (2011)

Bang Ye Wu: On the Maximum Locally Clustered Subgraph and Some Related Problems. COCOA 2011: 234-246

Bang Ye Wu: The maximum disjoint paths problem on multi-relations social networks. CoRR abs/1104.4370 (2011)

Bang Ye Wu: A simpler and more efficient algorithm for the next-to-shortest path problem. CoRR abs/1105.0608 (2011)

Bang Ye Wu: Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs. CoRR abs/1105.5915 (2011)

An-Chiang Chu, Bang Ye Wu, Hung-Lung Wang, Kun-Mao Chao: A tight bound on the min-ratio edge-partitioning problem of a tree. Discrete Applied Mathematics 158(14): 1471-1478 (2010)

Li-Hsing Yen, Bang Ye Wu, Chia-Cheng Yang: Tree-based object tracking without mobility statistics in wireless sensor networks. Wireless Networks 16(5): 1263-1276 (2010)

Bang Ye Wu: A 7/6-Approximation Algorithm for the Max-Min Connected Bipartition Problem on Grid Graphs. CGGA 2010: 188-194

Bang Ye Wu: A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem. COCOA (2) 2010: 219-227

Chin-Ping Yang, Chen-Yi Liu, Bang Ye Wu: Influence Clubs in Social Networks. ICCCI (2) 2010: 1-10

Bang Ye Wu: An optimal algorithm for the maximum-density path in a tree. Inf. Process. Lett. 109(17): 975-979 (2009)

Hung-Lung Wang, Bang Ye Wu, Kun-Mao Chao: The backup 2-center and backup 2-median problems on trees. Networks 53(1): 39-49 (2009)

Bang Ye Wu, Chih-Yuan Hsiao, Kun-Mao Chao: The Swap Edges of a Multiple-Sources Routing Tree. Algorithmica 50(3): 299-311 (2008)

Pei-Hao Ho, Arie Tamir, Bang Ye Wu: Minimum L_k path partitioning - An illustration of the Monge property. Oper. Res. Lett. 36(1): 43-45 (2008)

Shih Ta Kuan, Bang Ye Wu, Wan-Jui Lee: Finding Friend Groups in Blogosphere. AINA Workshops 2008: 1046-1050

Bang Ye Wu, Hung-Lung Wang, Shih Ta Kuan, Kun-Mao Chao: On the uniform edge-partition of a tree. Discrete Applied Mathematics 155(10): 1213-1223 (2007)

Bang Ye Wu, Hsiu-Hui Ou: Performances of List Scheduling for Set Partition Problems. J. Inf. Sci. Eng. 23(2): 641-647 (2007)

Chia-Mao Huang, Bang Ye Wu, Chang-Biau Yang: Tree edge decomposition with an application to minimum ultrametric tree approximation. J. Comb. Optim. 12(3): 217-230 (2006)

Yen Hung Chen, Bang Ye Wu, Chuan Yi Tang: Approximation algorithms for some k-source shortest paths spanning tree problems. Networks 47(3): 147-156 (2006)

Bang Ye Wu: On the intercluster distance of a tree metric. Theor. Comput. Sci. 369(1-3): 136-141 (2006)

Bang Ye Wu: An analysis of the LPT algorithm for the max-min and the min-ratio partition problems. Theor. Comput. Sci. 349(3): 407-419 (2005)

Bang Ye Wu: Approximation algorithms for the optimal p-source communication spanning tree. Discrete Applied Mathematics 143(1-3): 31-42 (2004)

Bang Ye Wu: An improved algorithm for the k-source maximum eccentricity spanning trees. Discrete Applied Mathematics 143(1-3): 342-350 (2004)

Bang Ye Wu, Zheng-Nan Huang, Fu-Jie Zhan: Exact algorithms for the minimum latency problem. Inf. Process. Lett. 92(6): 303-309 (2004)

Bang Ye Wu: Constructing the Maximum Consensus Tree from Rooted Triples. J. Comb. Optim. 8(1): 29-39 (2004)

Bang Ye Wu: Constructing Evolutionary Trees from Rooted Triples. J. Inf. Sci. Eng. 20(1): 181-190 (2004)

Yen Hung Chen, Bang Ye Wu, Chuan Yi Tang: Approximation Algorithms for k-Source Bottleneck Routing Cost Spanning Tree Problems. ICCSA (3) 2004: 355-366

Bang Ye Wu: A polynomial time approximation scheme for the two-source minimum routing cost spanning trees. J. Algorithms 44(2): 359-378 (2002)

Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang: Light graphs with small routing cost. Networks 39(3): 130-138 (2002)

Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang: Approximation algorithms for some optimum communication spanning tree problems. Discrete Applied Mathematics 102(3): 245-266 (2000)

Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang: Approximation algorithms for the shortest total path length spanning tree problem. Discrete Applied Mathematics 105(1-3): 273-289 (2000)

Bang Ye Wu: Polynomial time algorithms for some minimum latency problems. Inf. Process. Lett. 75(5): 225-229 (2000)

Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang: A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees. J. Algorithms 36(2): 182-204 (2000)

Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang: An Efficient Algorithm for the Length-Constrained Heaviest Path Problem on a Tree. Inf. Process. Lett. 69(2): 63-67 (1999)

Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang: Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices. J. Comb. Optim. 3(2-3): 199-211 (1999)

Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao Chao, R. Ravi, Chuan Yi Tang: A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees. SIAM J. Comput. 29(3): 761-778 (1999)

Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang: Constructing Light Spanning Trees with Small Routing Cost. STACS 1999: 334-344

Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang: Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices. COCOON 1998: 299-308

Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang: Approximation Algorithms for Some Optimum Communication Spanning Tree Problems. ISAAC 1998: 407-416

Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao Chao, R. Ravi, Chuan Yi Tang: A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees. SODA 1998: 21-32

Bang Ye Wu, Chuan Yi Tang: An O(n) Algorithm for Finding an Optimal Position with Relative Distances in an Evolutionary Tree. Inf. Process. Lett. 63(5): 263-269 (1997)

Bang Ye Wu, Chuan Yi Tang: Ranking Unranking and Parallel Enumerating of Topological Orders. ICPP (3) 1991: 284-285