Wei Wang

J. Optim. Theory Appl., February, 2023

Greedy guarantees for minimum submodular cost submodular/non-submodular cover problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2023

2021

Monitoring and Evaluating Restoration Vegetation Status in Mine Region Using Remote Sensing Data: Case Study in Inner Mongolia, China.

[BibT_eX]

[DOI]

Remote. Sens., 2021

Greedy approximation for the minimum connected dominating set with labeling.

[BibT_eX]

[DOI]

Optim. Lett., 2021

Algorithms and Complexity for a Class of Combinatorial Optimization Problems with Labelling.

[BibT_eX]

[DOI]

J. Optim. Theory Appl., 2021

Non-monotone submodular function maximization under k-system constraint.

[BibT_eX]

[DOI]

J. Comb. Optim., 2021

Minimum non-submodular cover problem with applications.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2021

Urban Forest Identification from High-Resolution Images Using Deep-Learning Method.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Geoscience and Remote Sensing Symposium, 2021

2020

Evaluation of Spatial-Temporal Variation of Vegetation Restoration in Dexing Copper Mine Area Using Remote Sensing Data.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Geoscience and Remote Sensing Symposium, 2020

2018

On Practical Construction of Quality Fault-Tolerant Virtual Backbone in Homogeneous Wireless Networks.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2018

2017

A New Comprehensive RSU Installation Strategy for Cost-Efficient VANET Deployment.

[BibT_eX]

[DOI]

IEEE Trans. Veh. Technol., 2017

A New Constant Factor Approximation to Construct Highly Fault-Tolerant Connected Dominating Set in Unit Disk Graph.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2017

On Theoretical Trajectory Planning of Multiple Drones To Minimize Latency in Search-and-Reconnaissance Operations.

[BibT_eX]

[DOI]

IEEE Trans. Mob. Comput., 2017

Maximum Lifetime Combined Barrier-Coverage of Weak Static Sensors and Strong Mobile Sensors.

[BibT_eX]

[DOI]

IEEE Trans. Mob. Comput., 2017

2016

Fault-Tolerant Connected Dominating Set.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

The first constant factor approximation for minimum partial connected dominating set problem in growth-bounded graphs.

[BibT_eX]

[DOI]

Wirel. Networks, 2016

On Approximating Minimum 3-Connected m-Dominating Set Problem in Unit Disk Graph.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2016

Approximation algorithms for minimum weight partial connected set cover problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2016

A simple greedy approximation algorithm for the minimum connected k-Center problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2016

A joint optimization of data ferry trajectories and communication powers of ground sensors for long-term environmental monitoring.

[BibT_eX]

[DOI]

J. Comb. Optim., 2016

On cost-aware biased respondent group selection for minority opinion survey.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2016

On efficient vaccine distribution strategy to suppress pandemic using social relation.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2016

Exact solutions for Latency-Bounded Target Set Selection Problem on some special families of graphs.

[BibT_eX]

[DOI]

Xianliang Liu

Discret. Appl. Math., 2016

Cost effective mobile and static road side unit deployment for vehicular adhoc networks.

[BibT_eX]

[DOI]

Proceedings of the 2016 International Conference on Computing, 2016

A Simpler Constant Factor Approximation for the k-Connected m-Domination Set Problem in Unit Disk Graph.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on Computer Communication and Networks, 2016

2015

Bandwidth-aware breach-free barrier construction with VANET nodes for realtime fugitive search.

[BibT_eX]

[DOI]

Proceedings of the 34th IEEE Military Communications Conference, 2015

A better constant approximation for minimum 3-connected m-dominating set problem in unit disk graph using Tutte decomposition.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Conference on Computer Communications, 2015

Biased Respondent Group Selection Under Limited Budget for Minority Opinion Survey.

[BibT_eX]

[DOI]

Proceedings of the Computational Social Networks - 4th International Conference, 2015

Social Relation Based Long-Term Vaccine Distribution Planning to Suppress Pandemic.

[BibT_eX]

[DOI]

Proceedings of the Computational Social Networks - 4th International Conference, 2015

2014

Minimum Latency Multiple Data MULETrajectory Planning in Wireless Sensor Networks.

[BibT_eX]

[DOI]

IEEE Trans. Mob. Comput., 2014

Multiple heterogeneous data ferry trajectory planning in wireless sensor networks.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE Conference on Computer Communications, 2014

2013

Time-Efficient Protocols for Neighbor Discovery in Wireless Ad Hoc Networks.

[BibT_eX]

[DOI]

IEEE Trans. Veh. Technol., 2013

On Construction of Quality Fault-Tolerant Virtual Backbone in Wireless Networks.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2013

PTAS for the minimum k-path connected vertex cover problem in unit disk graphs.

[BibT_eX]

[DOI]

J. Glob. Optim., 2013

On bounding node-to-sink latency in wireless sensor networks with multiple sinks.

[BibT_eX]

[DOI]

Int. J. Sens. Networks, 2013

Generalized Spectral Characterization of Graphs Revisited.

[BibT_eX]

[DOI]

Electron. J. Comb., 2013

2012

PTAS for the minimum weighted dominating set in growth bounded graphs.

[BibT_eX]

[DOI]

Zhong Wang

Joonmo Kim

Bhavani Thuraisingham

Weili Wu

J. Glob. Optim., 2012

A PTAS for the minimum weighted dominating set problem with smooth weights on unit disk graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2012

Polynomial time approximation scheme for t-latency bounded information propagation problem in wireless networks.

[BibT_eX]

[DOI]

J. Comb. Optim., 2012

Constructing minimum interference connected dominating set for multi-channel multi-radio multi-hop wireless network.

[BibT_eX]

[DOI]

Int. J. Sens. Networks, 2012

Minimizing data collection latency in wireless sensor network with multiple mobile elements.

[BibT_eX]

[DOI]

Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 2012

2011

Minimum Data-Latency-Bound $k$-Sink Placement Problem in Wireless Sensor Networks.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2011

PTAS for minimum weighted connected vertex cover problem with c-local condition in unit disk graphs.

[BibT_eX]

[DOI]

Lidan Fan

Zhao Zhang

J. Comb. Optim., 2011

Vertex-deleted subgraphs and regular factors from regular graph.

[BibT_eX]

[DOI]

Hongliang Lu

Bing Bai

Discret. Math., 2011

2010

A Better Approximation Algorithm for Computing Connected Dominating Sets in Unit Ball Graphs.

[BibT_eX]

[DOI]

IEEE Trans. Mob. Comput., 2010

Minimum average routing path clustering problem in multi-hop 2-D underwater sensor networks.

[BibT_eX]

[DOI]

Optim. Lett., 2010

A PTAS for minimum <i>d</i>-hop connected dominating set in growth-bounded graphs.

[BibT_eX]

[DOI]

Optim. Lett., 2010

Hardness of <i>k</i>-Vertex-Connected Subgraph Augmentation Problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2010

An efficient approximation for minimum latency broadcast in multi-channel multi-hop wireless networks.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2010

A New Constant Factor Approximation for Computing 3-Connected m-Dominating Sets in Homogeneous Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

2009

A uniqueness theorem on matrices and reconstruction.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2009

A Better Approximation for Minimum Average Routing Path Clustering Problem in 2-d Underwater Sensor Networks.

[BibT_eX]

[DOI]