Wei Ding

37 papers C 13Misc 1Journal 18Unranked 5
YearRankTypeTitle / Venue / Authors
2025 J jnl
A polynomial-time exact algorithm for the connected k-facility location problem on trees.
Discret. Math. Algorithms Appl.
Wei Ding, Guangting Chen, Yu Zhou, Ke Qiu
2025 C conf
An Improved Approximation Algorithm for the k-Supplier Problem with Parameterized Triangle Inequality.
TAMC
Wei Ding, Guangting Chen, Ke Qiu, Yu Zhou
2025 J jnl
Parameterized Approximations for the Minimum Diameter Vertex-Weighted Steiner Tree Problem in Graphs with Parameterized Weights.
Asia Pac. J. Oper. Res.
Wei Ding, Guangting Chen, Ke Qiu, Yu Zhou
2022 J jnl
A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs.
J. Comb. Optim.
Wei Ding, Ke Qiu, Yu Zhou, Zhou Ye
2021 Misc conf
Finding Cheapest Deadline Paths.
COCOON
Wei Ding
2020 J jnl
A 2-approximation algorithm and beyond for the minimum diameter
Theor. Comput. Sci.
Wei Ding, Ke Qiu
2020 J jnl
A branch-and-cut approach to examining the maximum density guarantee for pinwheel schedulability of low-dimensional vectors.
Real Time Syst.
Wei Ding
2020 J jnl
Approximating the asymmetric p-center problem in parameterized complete digraphs.
J. Comb. Optim.
Wei Ding, Ke Qiu
2020 C conf
Minimum Diameter Vertex-Weighted Steiner Tree.
AAIM
Wei Ding, Ke Qiu
2019 J jnl
Approximating the restricted 1-center in graphs.
Theor. Comput. Sci.
Wei Ding, Ke Qiu
2019 C conf
Constant-Factor Greedy Algorithms for the Asymmetric p-Center Problem in Parameterized Complete Digraphs.
AAIM
Wei Ding, Ke Qiu
2019 C conf
Low-Dimensional Vectors with Density Bounded by 5/6 Are Pinwheel Schedulable.
AAIM
Wei Ding
2019 — conf
Sifting Edges to Accelerate the Computation of Absolute 1-Center in Graphs.
WCGO
Wei Ding, Ke Qiu
2019 C conf
Updating Matrix Polynomials.
AAIM
Wei Ding, Ke Qiu
2018 J jnl
A quadratic time exact algorithm for continuous connected 2-facility location problem in trees.
J. Comb. Optim.
Wei Ding, Ke Qiu
2018 C conf
Minimum Diameter k-Steiner Forest.
AAIM
Wei Ding, Ke Qiu
2017 J jnl
An FPTAS for generalized absolute 1-center problem in vertex-weighted graphs.
J. Comb. Optim.
Wei Ding, Ke Qiu
2017 J jnl
Incremental single-source shortest paths in digraphs with arbitrary positive arc weights.
Theor. Comput. Sci.
Wei Ding, Ke Qiu
2016 C conf
A Quadratic Time Exact Algorithm for Continuous Connected 2-Facility Location Problem in Trees (Extended Abstract).
COCOA
Wei Ding, Ke Qiu
2015 J jnl
An Edge-Turbulence Algorithm for the 2-MRS Problem on Trees with Unreliable Edges.
Asia Pac. J. Oper. Res.
Yu Zhou, Wei Ding, Guangming Wang, Guangting Chen
2015 C conf
Approximating the Restricted 1-Center in Graphs.
COCOA
Wei Ding, Ke Qiu
2015 C conf
Dynamic Single-Source Shortest Paths in Erdös-Rényi Random Graphs.
COCOA
Wei Ding, Ke Qiu
2014 J jnl
Algorithms for the minimum diameter terminal Steiner tree problem.
J. Comb. Optim.
Wei Ding, Ke Qiu
2014 J jnl
Minimum diameter cost-constrained Steiner trees.
J. Comb. Optim.
Wei Ding, Guoliang Xue
2014 C conf
Partially Dynamic Single-Source Shortest Paths on Digraphs with Positive Weights.
AAIM
Wei Ding, Guohui Lin
2014 J jnl
Weighted Cache Location Problem with Identical Servers.
J. Appl. Math.
Hongfa Wang, Wei Ding
2013 J jnl
On the 2-MRS Problem in a Tree with Unreliable Edges.
J. Appl. Math.
Wei Ding, Yu Zhou, Guangting Chen, Hongfa Wang, Guangming Wang
2012 — conf
An Improved Approximation Algorithm for the Bandpass Problem.
FAW-AAIM
Weitian Tong, Randy Goebel, Wei Ding, Guohui Lin
2012 C conf
On the Minimum Diameter Cost-Constrained Steiner Tree Problem.
COCOA
Wei Ding, Guoliang Xue
2011 J jnl
A Divide-and-Conquer Algorithm for Finding a Most Reliable Source on a Ring-Embedded Tree Network with Unreliable Edges.
Discret. Math. Algorithms Appl.
Wei Ding, Guoliang Xue
2011 C conf
A Fast Parallel Algorithm for Finding a Most Reliable Source on a General Ring-Tree Graph with Unreliable Edges.
COCOA
Wei Ding, Guoliang Xue
2011 J jnl
A linear time algorithm for computing a most reliable source on a tree network with faulty nodes.
Theor. Comput. Sci.
Wei Ding, Guoliang Xue
2011 J jnl
Diameter-Constrained Steiner Trees.
Discret. Math. Algorithms Appl.
Wei Ding, Guohui Lin, Guoliang Xue
2010 — conf
A Divide-and-Conquer Algorithm for Computing a Most Reliable Source on an Unreliable Ring-Embedded Tree.
COCOA (2)
Wei Ding, Guoliang Xue
2010 — conf
Diameter-Constrained Steiner Tree.
COCOA (2)
Wei Ding, Guohui Lin, Guoliang Xue
2009 C conf
A Linear Time Algorithm for Computing the Most Reliable Source on a Tree with Faulty Vertices.
COCOA
Wei Ding, Guoliang Xue
2004 — conf
The Web Proxy Location Problem in the Tree Networks.
CCCT (1)
Guangting Chen, Gu Zhang, Wei Ding