default search action
Wei Ding 0006
Person information
- affiliation: Zhejiang University of Water Resources and Electric Power, Hangzhou, China
Other persons with the same name
- Wei Ding — disambiguation page
- Wei Ding 0001 — Southeast University, School of Computer Science and Engineering, Nanjing, China
- Wei Ding 0002 — IBM China Research Laboratory, Beijing, China
- Wei Ding 0003
— University of Massachusetts, Department of Computer Science, Boston, MA, USA (and 1 more)
- Wei Ding 0004 — Sonic Solutions
- Wei Ding 0005 — China Earthquake Administration, Key Laboratory of Earthquake Geodesy, Wuhan, China
- Wei Ding 0007
- Wei Ding 0008 — Qualcomm Innovation Center Inc., San Diego, CA, USA (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j16]Wei Ding
A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs. J. Comb. Optim. 44(2): 905-920 (2022) - 2021
- [c18]Wei Ding:
Finding Cheapest Deadline Paths. COCOON 2021: 476-486 - 2020
- [j15]Wei Ding
Approximating the asymmetric p-center problem in parameterized complete digraphs. J. Comb. Optim. 40(1): 21-35 (2020) - [j14]Wei Ding
A branch-and-cut approach to examining the maximum density guarantee for pinwheel schedulability of low-dimensional vectors. Real Time Syst. 56(3): 293-314 (2020) - [j13]Wei Ding
A 2-approximation algorithm and beyond for the minimum diameter k-Steiner forest problem. Theor. Comput. Sci. 840: 1-15 (2020) - [c17]Wei Ding
Minimum Diameter Vertex-Weighted Steiner Tree. AAIM 2020: 62-72
2010 – 2019
- 2019
- [j12]Wei Ding
Approximating the restricted 1-center in graphs. Theor. Comput. Sci. 774: 31-43 (2019) - [c16]Wei Ding
Low-Dimensional Vectors with Density Bounded by 5/6 Are Pinwheel Schedulable. AAIM 2019: 51-61 - [c15]Wei Ding
Constant-Factor Greedy Algorithms for the Asymmetric p-Center Problem in Parameterized Complete Digraphs. AAIM 2019: 62-71 - [c14]Wei Ding
Updating Matrix Polynomials. AAIM 2019: 72-82 - [c13]Wei Ding
Sifting Edges to Accelerate the Computation of Absolute 1-Center in Graphs. WCGO 2019: 468-476 - 2018
- [j11]Wei Ding
A quadratic time exact algorithm for continuous connected 2-facility location problem in trees. J. Comb. Optim. 36(4): 1262-1298 (2018) - [c12]Wei Ding
Minimum Diameter k-Steiner Forest. AAIM 2018: 1-11 - 2017
- [j10]Wei Ding
An FPTAS for generalized absolute 1-center problem in vertex-weighted graphs. J. Comb. Optim. 34(4): 1084-1095 (2017) - [j9]Wei Ding
Incremental single-source shortest paths in digraphs with arbitrary positive arc weights. Theor. Comput. Sci. 674: 16-31 (2017) - 2016
- [c11]Wei Ding
A Quadratic Time Exact Algorithm for Continuous Connected 2-Facility Location Problem in Trees (Extended Abstract). COCOA 2016: 408-420 - 2015
- [j8]Yu Zhou, Wei Ding
An Edge-Turbulence Algorithm for the 2-MRS Problem on Trees with Unreliable Edges. Asia Pac. J. Oper. Res. 32(1): 1540010:1-1540010:17 (2015) - [c10]Wei Ding
Dynamic Single-Source Shortest Paths in Erdös-Rényi Random Graphs. COCOA 2015: 537-550 - [c9]Wei Ding
Approximating the Restricted 1-Center in Graphs. COCOA 2015: 647-659 - 2014
- [j7]Hongfa Wang, Wei Ding
Weighted Cache Location Problem with Identical Servers. J. Appl. Math. 2014: 586146:1-586146:11 (2014) - [j6]Wei Ding
Minimum diameter cost-constrained Steiner trees. J. Comb. Optim. 27(1): 32-48 (2014) - [j5]Wei Ding
Algorithms for the minimum diameter terminal Steiner tree problem. J. Comb. Optim. 28(4): 837-853 (2014) - [c8]Wei Ding
Partially Dynamic Single-Source Shortest Paths on Digraphs with Positive Weights. AAIM 2014: 197-207 - 2013
- [j4]Wei Ding
On the 2-MRS Problem in a Tree with Unreliable Edges. J. Appl. Math. 2013: 743908:1-743908:11 (2013) - 2012
- [c7]Weitian Tong
An Improved Approximation Algorithm for the Bandpass Problem. FAW-AAIM 2012: 351-358 - [c6]Wei Ding
On the Minimum Diameter Cost-Constrained Steiner Tree Problem. COCOA 2012: 37-48 - 2011
- [j3]Wei Ding
Diameter-Constrained Steiner Trees. Discret. Math. Algorithms Appl. 3(4): 491-502 (2011) - [j2]Wei Ding
A Divide-and-Conquer Algorithm for Finding a Most Reliable Source on a Ring-Embedded Tree Network with Unreliable Edges. Discret. Math. Algorithms Appl. 3(4): 503-516 (2011) - [j1]Wei Ding
A linear time algorithm for computing a most reliable source on a tree network with faulty nodes. Theor. Comput. Sci. 412(3): 225-232 (2011) - [c5]Wei Ding
A Fast Parallel Algorithm for Finding a Most Reliable Source on a General Ring-Tree Graph with Unreliable Edges. COCOA 2011: 98-112 - 2010
- [c4]Wei Ding
Diameter-Constrained Steiner Tree. COCOA (2) 2010: 243-253 - [c3]Wei Ding
A Divide-and-Conquer Algorithm for Computing a Most Reliable Source on an Unreliable Ring-Embedded Tree. COCOA (2) 2010: 268-280
2000 – 2009
- 2009
- [c2]Wei Ding
A Linear Time Algorithm for Computing the Most Reliable Source on a Tree with Faulty Vertices. COCOA 2009: 14-23 - 2004
- [c1]Guangting Chen, Gu Zhang, Wei Ding:
The Web Proxy Location Problem in the Tree Networks. CCCT (1) 2004: 343-348
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-13 19:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: