Ding-Zhu Du
University of Texas at Dallas
Wireless networkAlgorithmCombinatoricsDiscrete mathematicsDistributed computingMathematical optimizationGraphDominating setApproximation algorithmSet (abstract data type)Network topologyWireless sensor networkTime complexityComputer networkMathematicsConnected dominating setComputer scienceGreedy algorithmSteiner tree problemTheoretical computer science
464Publications
61H-index
11kCitations
Publications 449
Newest
#1Weidong Chen (SCNU: South China Normal University)
#2Hao Zhong (SCNU: South China Normal University)
Last. Ding-Zhu Du (UTD: University of Texas at Dallas)H-Index: 61
view all 4 authors...
In social networks, the minimum positive influence dominating set (MPIDS) problem is NP-hard, which means it is unlikely to be solved precisely in polynomial time. For the purpose of efficiently solving this problem, greedy approximation algorithms seem appealing because they are fast and can provide guaranteed solutions. In this paper, based on the classic greedy algorithm for cardinality submodular cover, we propose a general greedy approximation algorithm (GGAA) for the MPIDS problem, which u...
Source
#1Yuqi Fan (Hefei University of Technology)H-Index: 6
#2Chen Wang (Hefei University of Technology)H-Index: 5
Last. Ding-Zhu DuH-Index: 61
view all 5 authors...
With the explosive growth in the scale of cloud computing infrastructures, reliability and energy efficiency have become important concerns considering the great complexity of cloud data centers. There is an urgent need for efficient task assignment that can dispatch tasks to appropriate cloud data center servers, which is critical to achieve reliability and energy efficiency in current cloud data centers. Most of the research on task assignment focuses on only one of the objectives of reliabili...
Source
Jul 1, 2021 in ICDCS (International Conference on Distributed Computing Systems)
#2Wenjie Zou (FZU: Fuzhou University)H-Index: 1
Source
#1Chenfei Hou (Hebei Normal University)
#2Suogang Gao (Hebei Normal University)H-Index: 7
Last. Bo Hou (Hebei Normal University)H-Index: 2
view all 6 authors...
In this paper, we consider the submodular multicut problem in trees with linear penalties (SMCLP(T) problem). In the SMCLP(T) problem, we are given a tree $T=(V,E) with a submodular function c(\cdot ): 2^{E}\rightarrow \mathbb {R}_{\ge 0} , a set of k distinct pairs of vertices P=\{(s_1,t_1),(s_2,t_2),\ldots ,(s_k,t_k)\} with non-negative penalty costs \pi _{j} for the pairs (s_j,t_j)\in P . The goal is to find a partial multicut M\subseteq E such that the total cost, cons...
Source
#2Suogang GaoH-Index: 7
Last. Bo HouH-Index: 2
view all 6 authors...
In this paper, we introduce the k-generalized Steiner forest (k-GSF) problem, which is a natural generalization of the k-Steiner forest problem and the generalized Steiner forest problem. In this problem, we are given a connected graph $G =(V,E) with non-negative costs c_{e} for the edges e\in E , a set of disjoint vertex sets {\mathcal {V}}=\{V_{1},V_{2},\ldots ,V_{l}\} and a parameter k\le l . The goal is to find a minimum-cost edge set F\subseteq E that connects at leas...
Source
#1Yingli Ran (ZJNU: Zhejiang Normal University)H-Index: 5
#2Xiaohui Huang (ZJNU: Zhejiang Normal University)H-Index: 6
Last. Ding-Zhu Du (UTD: University of Texas at Dallas)H-Index: 61
view all 4 authors...
In this paper, we consider the wireless sensor network in which the power of each sensor is adjustable. Given a set of sensors and a set of targets, we study a problem of minimizing the total power such that the coverage of targets meets partial multi-cover requirement, that is, there are at least a given number of targets each covered by a given number of sensors (this number is called the covering requirement for the target). This is called the minimum power partial multi-cover problem (MinPow...
Source
#1Yingli Ran (ZJNU: Zhejiang Normal University)H-Index: 5
#2Xiaohui Huang (ZJNU: Zhejiang Normal University)H-Index: 6
Last. Ding-Zhu Du (UTD: University of Texas at Dallas)H-Index: 61
view all 4 authors...
In a minimum partial set multi-cover problem (MinPSMC), given an element set X, a collection of subsets null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null ${\mathcal {S}} \subseteq 2^X null null null null null null null null null null null null null null nul...
Source
Source
#1Yapu Zhang (CAS: Chinese Academy of Sciences)H-Index: 2
#2Wenguo Yang (CAS: Chinese Academy of Sciences)H-Index: 6
Last. Ding-Zhu Du (UTD: University of Texas at Dallas)H-Index: 61
view all 3 authors...
Abstract Admittedly, innovations can spread rapidly in online social networks, while the spread of malicious rumors can lead to a series of negative consequences. Therefore, it is necessary to take effective measures to limit the influence of negative information. In reality, people will become an adopter of innovations after being influenced by their friends. Meanwhile, they can be more likely to become a follower if they have received relevant information in advance. Motivated by these observa...
Source
#1Luobing Dong (Xidian University)H-Index: 3
#2Weili Wu (UTD: University of Texas at Dallas)H-Index: 37
Last. Ding-Zhu Du (UTD: University of Texas at Dallas)H-Index: 61
view all 6 authors...
Mobile edge computing system provides cloud computing capabilities at the edge of wireless mobile networks, ensuring low latency, highly efficient computing, and improved user experience. At the same time, computationally intensive components are offloaded from mobile devices to edge servers and distributed among the servers. Due to the special constraints (mobile devices’ battery capacities, limited computing resources of one single edge server, inevitable edge server failure, etc.), there emer...
Source
This website uses cookies.
We use cookies to improve your online experience. By continuing to use our website we assume you agree to the placement of these cookies.
To learn more, you can find in our Privacy Policy.