What is he best known for?
The fields of study he is best known for:
- Computer network
- Statistics
- Artificial intelligence
Weili Wu mainly focuses on Approximation algorithm, Connected dominating set, Wireless sensor network, Mathematical optimization and Discrete mathematics.
Weili Wu has included themes like Algorithm design, Wireless network, Graph theory and Time complexity in his Approximation algorithm study.
His Connected dominating set research integrates issues from Upper and lower bounds, Topology, Unit disk graph and Dominating set.
Weili Wu interconnects Sensor node, Key distribution in wireless sensor networks, Scheduling and Discrete event simulation in the investigation of issues within Wireless sensor network.
His Mathematical optimization research is multidisciplinary, relying on both Latency and Social network.
His research in Discrete mathematics intersects with topics in Function and Combinatorics.
His most cited work include:
- Energy-efficient target coverage in wireless sensor networks (877 citations)
- A Polynomial-Time Approximation Scheme for the Minimum-Connected Dominating Set in Ad Hoc Wireless Networks (287 citations)
- Minimum connected dominating sets and maximal independent sets in unit disk graphs (209 citations)
What are the main themes of his work throughout his whole career to date?
His main research concerns Approximation algorithm, Mathematical optimization, Combinatorics, Discrete mathematics and Computer network.
His Approximation algorithm research includes elements of Time complexity, Upper and lower bounds, Wireless sensor network and Connected dominating set.
His research integrates issues of Key distribution in wireless sensor networks, Real-time computing and Topology in his study of Wireless sensor network.
His Connected dominating set research is multidisciplinary, incorporating elements of Shortest path problem and Unit disk graph.
His research investigates the connection with Mathematical optimization and areas like Social network which intersect with concerns in Theoretical computer science, Artificial intelligence and Misinformation.
The various areas that Weili Wu examines in his Computer network study include Wireless network, Efficient energy use and Distributed computing.
He most often published in these fields:
- Approximation algorithm (23.20%)
- Mathematical optimization (20.27%)
- Combinatorics (20.27%)
What were the highlights of his more recent work (between 2018-2021)?
- Mathematical optimization (20.27%)
- Maximization (11.49%)
- Submodular set function (9.01%)
In recent papers he was focusing on the following fields of study:
The scientist’s investigation covers issues in Mathematical optimization, Maximization, Submodular set function, Approximation algorithm and Greedy algorithm.
His Mathematical optimization research incorporates themes from Social network, Cardinality, Function, Upper and lower bounds and Profit maximization.
His biological study spans a wide range of topics, including Hypergraph, Monotone polygon, Time complexity, Node and Generalization.
The subject of his Submodular set function research is within the realm of Combinatorics.
Weili Wu has researched Approximation algorithm in several fields, including Wireless sensor network, Real-time computing, Constraint, Linear programming and Blocking.
His Greedy algorithm study is concerned with Algorithm in general.
Between 2018 and 2021, his most popular works were:
- An Efficient Randomized Algorithm for Rumor Blocking in Online Social Networks (31 citations)
- Speech corpora subset selection based on time-continuous utterances features (24 citations)
- Social Influence Maximization in Hypergraph in Social Networks (21 citations)
In his most recent research, the most cited papers focused on:
- Computer network
- Statistics
- The Internet
Submodular set function, Approximation algorithm, Greedy algorithm, Mathematical optimization and Maximization are his primary areas of study.
To a larger extent, Weili Wu studies Combinatorics with the aim of understanding Submodular set function.
In his study, Weili Wu carries out multidisciplinary Approximation algorithm and Rumor research.
His study with Greedy algorithm involves better knowledge in Algorithm.
The Mathematical optimization study combines topics in areas such as Upper and lower bounds, Social network, Constraint, Cardinality and Partition.
His Social network study integrates concerns from other disciplines, such as Discrete mathematics, Approximate solution and Profit.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
