Bang Ye Wu

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
The next‐to‐shortest path problem on directed graphs with positive edge weights	2018-05-23	Paper
Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality	2017-11-14	Paper
Parameterized algorithms for min-max 2-cluster editing	2017-10-17	Paper
On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality	2017-07-21	Paper
On the minimum routing cost clustered tree problem	2017-06-22	Paper
An improved parameterized algorithm for the \(p\)-cluster vertex deletion problem	2017-02-22	Paper
Approximation Algorithms for the Star k-Hub Center Problem in Metric Graphs	2016-09-02	Paper
An efficient algorithm for the length-constrained heaviest path problem on a tree	2016-06-16	Paper
Polynomial time algorithms for some minimum latency problems	2016-06-16	Paper
A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion	2015-10-29	Paper
Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions	2015-09-02	Paper
On the clustered Steiner tree problem	2015-07-28	Paper
On approximating metric 1-median in sublinear time	2014-04-15	Paper
On the Clustered Steiner Tree Problem	2013-12-10	Paper
Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs	2013-12-02	Paper
A linear-time algorithm for finding an edge-partition with max-min ratio at most two	2013-04-25	Paper
A simpler and more efficient algorithm for the next-to-shortest path problem	2013-03-05	Paper
FULLY POLYNOMIAL-TIME APPROXIMATION SCHEMES FOR THE MAX–MIN CONNECTED PARTITION PROBLEM ON INTERVAL GRAPHS	2012-08-27	Paper
On the maximum disjoint paths problem on edge-colored graphs	2012-07-12	Paper
A note on approximating the min-max vertex disjoint paths on directed acyclic graphs	2012-01-11	Paper
A 7/6-Approximation Algorithm for the Max-Min Connected Bipartition Problem on Grid Graphs	2011-11-11	Paper
On the Maximum Locally Clustered Subgraph and Some Related Problems	2011-08-12	Paper
A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem	2011-01-10	Paper
A tight bound on the min-ratio edge-partitioning problem of a tree	2010-11-25	Paper
An optimal algorithm for the maximum-density path in a tree	2010-08-20	Paper
Exact algorithms for the minimum latency problem	2009-08-27	Paper
The backup 2‐center and backup 2‐median problems on trees	2009-07-28	Paper
Minimum \(L_k\) path partitioning-an illustration of the Monge property	2008-05-29	Paper
The swap edges of a multiple-sources routing tree	2008-04-03	Paper
Computational Science and Its Applications – ICCSA 2004	2007-07-19	Paper
On the uniform edge-partition of a tree	2007-06-26	Paper
Tree edge decomposition with an application to minimum ultrametric tree approximation	2007-06-21	Paper
On the intercluster distance of a tree metric	2007-01-09	Paper
Approximation algorithms for somek-source shortest paths spanning tree problems	2006-06-06	Paper
An analysis of the LPT algorithm for the max-min and the min-ratio partition problems	2006-03-20	Paper
Constructing the maximum consensus tree from rooted Triples	2005-03-15	Paper
Approximation algorithms for the optimal \(p\)-source communication spanning tree	2004-11-23	Paper
An improved algorithm for the \(k\)-source maximum eccentricity spanning trees	2004-11-23	Paper
Spanning Trees and Optimization Problems	2004-01-18	Paper
A polynomial time approximation scheme for the two-source minimum routing cost spanning trees	2003-05-14	Paper
Light graphs with small routing cost	2002-07-01	Paper
Approximation algorithms for the shortest total path length spanning tree problem	2001-02-27	Paper
Approximation algorithms for some optimum communication spanning tree problems	2000-11-27	Paper
A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees	2000-08-27	Paper
A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees	2000-03-19	Paper
https://portal.mardi4nfdi.de/entity/Q4250159	2000-02-09	Paper
Approximation and exact algorithms for constructing minimum ultrametric trees from distance matrices	1999-11-21	Paper
https://portal.mardi4nfdi.de/entity/Q4218433	1999-03-30	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Bang Ye Wu