Wei Ding

According to our database, Wei Ding authored at least 33 papers between 2004 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2022

A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs.

Wei Ding, Ke Qiu, Yu Zhou, Zhou Ye

J. Comb. Optim., 2022

2021

Finding Cheapest Deadline Paths.

Wei Ding

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

2020

A 2-approximation algorithm and beyond for the minimum diameter <i>k</i>-Steiner forest problem.

Wei Ding, Ke Qiu

Theor. Comput. Sci., 2020

A branch-and-cut approach to examining the maximum density guarantee for pinwheel schedulability of low-dimensional vectors.

Wei Ding

Real Time Syst., 2020

Approximating the asymmetric p-center problem in parameterized complete digraphs.

Wei Ding, Ke Qiu

J. Comb. Optim., 2020

Minimum Diameter Vertex-Weighted Steiner Tree.

Wei Ding, Ke Qiu

Proceedings of the Algorithmic Aspects in Information and Management, 2020

2019

Approximating the restricted 1-center in graphs.

Wei Ding, Ke Qiu

Theor. Comput. Sci., 2019

Sifting Edges to Accelerate the Computation of Absolute 1-Center in Graphs.

Wei Ding, Ke Qiu

Proceedings of the Optimization of Complex Systems: Theory, 2019

Updating Matrix Polynomials.

Wei Ding, Ke Qiu

Proceedings of the Algorithmic Aspects in Information and Management, 2019

Constant-Factor Greedy Algorithms for the Asymmetric p-Center Problem in Parameterized Complete Digraphs.

Wei Ding, Ke Qiu

Proceedings of the Algorithmic Aspects in Information and Management, 2019

Low-Dimensional Vectors with Density Bounded by 5/6 Are Pinwheel Schedulable.

Wei Ding

Proceedings of the Algorithmic Aspects in Information and Management, 2019

2018

A quadratic time exact algorithm for continuous connected 2-facility location problem in trees.

Wei Ding, Ke Qiu

J. Comb. Optim., 2018

Minimum Diameter k-Steiner Forest.

Wei Ding, Ke Qiu

Proceedings of the Algorithmic Aspects in Information and Management, 2018

2017

Incremental single-source shortest paths in digraphs with arbitrary positive arc weights.

Wei Ding, Ke Qiu

Theor. Comput. Sci., 2017

An FPTAS for generalized absolute 1-center problem in vertex-weighted graphs.

Wei Ding, Ke Qiu

J. Comb. Optim., 2017

2016

A Quadratic Time Exact Algorithm for Continuous Connected 2-Facility Location Problem in Trees (Extended Abstract).

Wei Ding, Ke Qiu

Proceedings of the Combinatorial Optimization and Applications, 2016

2015

An Edge-Turbulence Algorithm for the 2-MRS Problem on Trees with Unreliable Edges.

Yu Zhou, Wei Ding, Guangming Wang, Guangting Chen

Asia Pac. J. Oper. Res., 2015

Dynamic Single-Source Shortest Paths in Erdös-Rényi Random Graphs.

Wei Ding, Ke Qiu

Proceedings of the Combinatorial Optimization and Applications, 2015

2014

Minimum diameter cost-constrained Steiner trees.

Wei Ding, Guoliang Xue

J. Comb. Optim., 2014

Algorithms for the minimum diameter terminal Steiner tree problem.

Wei Ding, Ke Qiu

J. Comb. Optim., 2014

Weighted Cache Location Problem with Identical Servers.

Hongfa Wang, Wei Ding

J. Appl. Math., 2014

Partially Dynamic Single-Source Shortest Paths on Digraphs with Positive Weights.

Wei Ding, Guohui Lin

Proceedings of the Algorithmic Aspects in Information and Management, 2014

2013

On the 2-MRS Problem in a Tree with Unreliable Edges.

Wei Ding, Yu Zhou, Guangting Chen, Hongfa Wang, Guangming Wang

J. Appl. Math., 2013

2012

On the Minimum Diameter Cost-Constrained Steiner Tree Problem.

Wei Ding, Guoliang Xue

Proceedings of the Combinatorial Optimization and Applications, 2012

An Improved Approximation Algorithm for the Bandpass Problem.

Weitian Tong, Randy Goebel, Wei Ding, Guohui Lin

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012

2011

A linear time algorithm for computing a most reliable source on a tree network with faulty nodes.

Wei Ding, Guoliang Xue

Theor. Comput. Sci., 2011

A Divide-and-Conquer Algorithm for Finding a Most Reliable Source on a Ring-Embedded Tree Network with Unreliable Edges.

Wei Ding, Guoliang Xue

Discret. Math. Algorithms Appl., 2011

Diameter-Constrained Steiner Trees.

Wei Ding, Guohui Lin, Guoliang Xue

Discret. Math. Algorithms Appl., 2011

A Fast Parallel Algorithm for Finding a Most Reliable Source on a General Ring-Tree Graph with Unreliable Edges.

Wei Ding, Guoliang Xue

Proceedings of the Combinatorial Optimization and Applications, 2011

2010

A Divide-and-Conquer Algorithm for Computing a Most Reliable Source on an Unreliable Ring-Embedded Tree.

Wei Ding, Guoliang Xue

Proceedings of the Combinatorial Optimization and Applications, 2010

Diameter-Constrained Steiner Tree.

Wei Ding, Guohui Lin, Guoliang Xue

Proceedings of the Combinatorial Optimization and Applications, 2010

2009

A Linear Time Algorithm for Computing the Most Reliable Source on a Tree with Faulty Vertices.

Wei Ding, Guoliang Xue

Proceedings of the Combinatorial Optimization and Applications, 2009

2004

The Web Proxy Location Problem in the Tree Networks.

Guangting Chen, Gu Zhang, Wei Ding

Proceedings of the 2nd International Conference Computing, 2004