Bang Ye Wu

Publication Activity (10 Years)

Years Active: 1991-2018
Publications (10 Years): 6

Top Topics

Approximation Schemes

Triangle Inequality

Top Venues

J. Comb. Optim.

Publications

Li-Hsuan Chen, Dun-Wei Cheng, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing, Chia-Wei Lee, Bang Ye Wu
Approximability and inapproximability of the star p-hub center problem with parameterized triangle inequality. J. Comput. Syst. Sci. 92 (2018)
Bang Ye Wu, Li-Hsuan Chen
An improved parameterized algorithm for the p-cluster vertex deletion problem. J. Comb. Optim. 33 (2) (2017)
Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing, Chia-Wei Lee, Bang Ye Wu
On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality. CIAC (2017)
Chen-Wan Lin, Bang Ye Wu
On the minimum routing cost clustered tree problem. J. Comb. Optim. 33 (3) (2017)
Li-Hsuan Chen, Bang Ye Wu
Parameterized algorithms for min-max 2-cluster editing. J. Comb. Optim. 34 (1) (2017)
Li-Hsuan Chen, Dun-Wei Cheng, Sun-Yuan Hsieh, Ling-Ju Hung, Chia-Wei Lee, Bang Ye Wu
Approximation Algorithms for the Star k-Hub Center Problem in Metric Graphs. COCOON (2016)
Bang Ye Wu, Li-Hsuan Chen
Parameterized Algorithms for the 2-Clustering Problem with Minimum Sum and Minimum Sum of Squares Objective Functions. Algorithmica 72 (3) (2015)
Bang Ye Wu, Chen-Wan Lin
On the clustered Steiner tree problem. J. Comb. Optim. 30 (2) (2015)
Bang Ye Wu, Hung-Lung Wang
The next-to-shortest path problem on directed graphs with positive edge weights. Networks 65 (3) (2015)
Bang Ye Wu
A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion. COCOON (2015)
Chen-Wan Lin, Bang Ye Wu
A 2-approximation algorithm for the clustered minimum routing cost tree problem. ICS (2014)
Bang Ye Wu, Chen-Wan Lin
Clustered Trees with Minimum Inter-cluster Distance. CSE (2014)
Bang Ye Wu
On approximating metric 1-median in sublinear time. Inf. Process. Lett. 114 (4) (2014)
Bang Ye Wu
Finding Centers and Medians of a Tree by Distance Queries. FUN (2014)
Li-Hsuan Chen, Maw-Shang Chang, Chun-Chieh Wang, Bang Ye Wu
On the Min-Max 2-Cluster Editing Problem. J. Inf. Sci. Eng. 29 (6) (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. Discret. Appl. Math. 161 (7-8) (2013)
Bang Ye Wu
A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem. Algorithmica 65 (2) (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 (2013)
Bang Ye Wu
Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs. J. Comb. Optim. 26 (3) (2013)
Bang Ye Wu
On the Clustered Steiner Tree Problem. COCOA (2013)
Bang Ye Wu
A simple approximation algorithm for the internal Steiner minimum tree. CoRR (2013)
Bang Ye Wu
On the maximum disjoint paths problem on edge-colored graphs. Discret. Optim. 9 (1) (2012)
Bang Ye Wu
Fully Polynomial-Time Approximation Schemes for the Max-Min Connected Partition Problem on Interval Graphs. Discret. Math. Algorithms 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 (2012)
Bang Ye Wu
A note on approximating the min-max vertex disjoint paths on directed acyclic graphs. J. Comput. Syst. Sci. 77 (6) (2011)
Bang Ye Wu
On the Maximum Locally Clustered Subgraph and Some Related Problems. COCOA (2011)
Yao-Ting Huang, Kuan-Hung Lin, Bang Ye Wu
A Structural Approach for Finding Real-Friend Links in Internet Social Networks. iThings/CPSCom (2011)
Bang Ye Wu
Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs CoRR (2011)
Bang Ye Wu
The maximum disjoint paths problem on multi-relations social networks CoRR (2011)
Bang Ye Wu
A simpler and more efficient algorithm for the next-to-shortest path problem CoRR (2011)
Bang Ye Wu
A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem. COCOA (2) (2010)
Bang Ye Wu
A 7/6-Approximation Algorithm for the Max-Min Connected Bipartition Problem on Grid Graphs. CGGA (2010)
Chin-Ping Yang, Chen-Yi Liu, Bang Ye Wu
Influence Clubs in Social Networks. ICCCI (2) (2010)
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. Discret. Appl. Math. 158 (14) (2010)
Li-Hsing Yen, Bang Ye Wu, Chia-Cheng Yang
Tree-based object tracking without mobility statistics in wireless sensor networks. Wirel. Networks 16 (5) (2010)
Hung-Lung Wang, Bang Ye Wu, Kun-Mao Chao
The backup 2-center and backup 2-median problems on trees. Networks 53 (1) (2009)
Bang Ye Wu
An optimal algorithm for the maximum-density path in a tree. Inf. Process. Lett. 109 (17) (2009)
Bang Ye Wu, Chih-Yuan Hsiao, Kun-Mao Chao
The Swap Edges of a Multiple-Sources Routing Tree. Algorithmica 50 (3) (2008)
Pei-Hao Ho, Arie Tamir, Bang Ye Wu
path partitioning - An illustration of the Monge property. Oper. Res. Lett. 36 (1) (2008)
Shih Ta Kuan, Bang Ye Wu, Wan-Jui Lee
Finding Friend Groups in Blogosphere. AINA Workshops (2008)
Bang Ye Wu, Hung-Lung Wang, Shih Ta Kuan, Kun-Mao Chao
On the uniform edge-partition of a tree. Discret. Appl. Math. 155 (10) (2007)
Bang Ye Wu, Hsiu-Hui Ou
Performances of List Scheduling for Set Partition Problems. J. Inf. Sci. Eng. 23 (2) (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) (2006)
Yen Hung Chen, Bang Ye Wu, Chuan Yi Tang
-source shortest paths spanning tree problems. Networks 47 (3) (2006)
Bang Ye Wu
On the intercluster distance of a tree metric. Theor. Comput. Sci. 369 (1-3) (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) (2005)
Bang Ye Wu
Constructing Evolutionary Trees from Rooted Triples. J. Inf. Sci. Eng. 20 (1) (2004)
Bang Ye Wu
-source communication spanning tree. Discret. Appl. Math. 143 (1-3) (2004)
Yen Hung Chen, Bang Ye Wu, Chuan Yi Tang
Approximation Algorithms for k-Source Bottleneck Routing Cost Spanning Tree Problems. ICCSA (3) (2004)
Bang Ye Wu, Zheng-Nan Huang, Fu-Jie Zhan
Exact algorithms for the minimum latency problem. Inf. Process. Lett. 92 (6) (2004)
Bang Ye Wu
Constructing the Maximum Consensus Tree from Rooted Triples. J. Comb. Optim. 8 (1) (2004)
Bang Ye Wu
An improved algorithm for the k-source maximum eccentricity spanning trees. Discret. Appl. Math. 143 (1-3) (2004)
Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
Light graphs with small routing cost. Networks 39 (3) (2002)
Bang Ye Wu
A polynomial time approximation scheme for the two-source minimum routing cost spanning trees. J. Algorithms 44 (2) (2002)
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) (2000)
Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
Approximation algorithms for the shortest total path length spanning tree problem. Discret. Appl. Math. 105 (1-3) (2000)
Bang Ye Wu
Polynomial time algorithms for some minimum latency problems. Inf. Process. Lett. 75 (5) (2000)
Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
Approximation algorithms for some optimum communication spanning tree problems. Discret. Appl. Math. 102 (3) (2000)
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) (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) (1999)
Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
Constructing Light Spanning Trees with Small Routing Cost. STACS (1999)
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) (1999)
Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
Approximation Algorithms for Some Optimum Communication Spanning Tree Problems. ISAAC (1998)
Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices. COCOON (1998)
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)
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) (1997)
Bang Ye Wu, Chuan Yi Tang
Ranking Unranking and Parallel Enumerating of Topological Orders. ICPP (3) (1991)