The following pages link to Weili Wu (Q199274):
Displaying 27 items.
- EFFICIENT DISTRIBUTED ALGORITHMS FOR TOPOLOGY CONTROL PROBLEM WITH SHORTEST PATH CONSTRAINTS (Q5189986) (← links)
- Algebraic Algorithm for Scheduling Data Retrieval in Multi-channel Wireless Data Broadcast Environments (Q5199141) (← links)
- Monotone submodular maximization over the bounded integer lattice with cardinality constraints (Q5207510) (← links)
- A fast double greedy algorithm for non-monotone DR-submodular function maximization (Q5216445) (← links)
- Optimal Social Influence (Q5216830) (← links)
- A PTAS for Weak Minimum Routing Cost Connected Dominating Set of Unit Disk Graph (Q5244687) (← links)
- (Q5324208) (← links)
- Optimal Data Retrieval Scheduling in the Multichannel Wireless Broadcast Environments (Q5369887) (← links)
- Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph (Q5505664) (← links)
- Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs (Q5505666) (← links)
- Nonsubmodular Optimization (Q5864850) (← links)
- Composed Influence Maximization in Social Networks (Q5864855) (← links)
- Optimization on Content Spread in Social Network Studies (Q5864857) (← links)
- Interaction-Aware Influence Maximization in Social Networks (Q5864858) (← links)
- Multi-Document Extractive Summarization as a Non-linear Combinatorial Optimization Problem (Q5864859) (← links)
- Viral Marketing for Complementary Products (Q5864860) (← links)
- Optimal placement of data replicas in distributed database with majority voting protocol (Q5941207) (← links)
- Mathematical theory of optimization (Q5941763) (← links)
- Algorithms for randomized time-varying knapsack problems (Q5963612) (← links)
- A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem (Q5963614) (← links)
- A binary search double greedy algorithm for non-monotone DR-submodular maximization (Q6167000) (← links)
- Distance magic labeling of the halved folded \(n\)-cube (Q6167023) (← links)
- Stochastic model for rumor blocking problem in social networks under rumor source uncertainty (Q6591650) (← links)
- Reinforcement learning for combating cyberbullying in online social networks (Q6606262) (← links)
- Neighbor sum distinguishing total coloring of planar graphs with restrained cycles (Q6637047) (← links)
- \(W\)-prize-collecting scheduling problem on parallel machines (Q6646746) (← links)
- Efficient algorithm for stochastic rumor blocking problem in social networks during safety accident period (Q6652431) (← links)
