Xiaohui Huang

Orcid: 0000-0003-0722-8852

Affiliations:
  • Zhejiang Normal University, College of Mathematics Physics and Information Engineering, Jinhua, China
  • Xinjiang University, College of Mathematics and System Sciences, Urumqi, China


According to our database1, Xiaohui Huang authored at least 29 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Approximation Algorithm and FPT Algorithm for Connected-<i>k</i>-Subgraph Cover on Minor-Free Graphs.
Math. Struct. Comput. Sci., 2024

2022
Approximation algorithm for minimum partial multi-cover under a geometric setting.
Optim. Lett., 2022

A distributed algorithm for a set cover game.
Discret. Math. Algorithms Appl., 2022

Computing Connected-k-Subgraph Cover with Connectivity Requirement.
Proceedings of the Theory and Applications of Models of Computation, 2022

2021
Minimum power partial multi-cover on a line.
Theor. Comput. Sci., 2021

Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks.
J. Glob. Optim., 2021

2020
Approximation algorithm for minimum weight connected-<i>k</i>-subgraph cover.
Theor. Comput. Sci., 2020

Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs.
Theor. Comput. Sci., 2020

2019
Online hole healing for sensor coverage.
J. Glob. Optim., 2019

Approximation algorithms for distance constraint sweep coverage with base stations.
J. Comb. Optim., 2019

Approximation algorithms for minimum weight connected 3-path vertex cover.
Appl. Math. Comput., 2019

Improved Approximation Algorithm for Minimum Weight k-Subgraph Cover Problem.
Proceedings of the Combinatorial Optimization and Applications, 2019

2018
A simpler PTAS for connected k-path vertex cover in homogeneous wireless sensor network.
J. Comb. Optim., 2018

Breaking the <i>O</i>(ln <i>n</i>) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set.
INFORMS J. Comput., 2018

Computing Minimum <i>k</i>-Connected <i>m</i>-Fold Dominating Set in General Graphs.
INFORMS J. Comput., 2018

Approximation algorithm for partial set multicover versus full set multicover.
Discret. Math. Algorithms Appl., 2018

Approximation algorithm for distance constraint sweep coverage without predetermined base stations.
Discret. Math. Algorithms Appl., 2018

PTAS for H-free node deletion problems in disk graphs.
Discret. Appl. Math., 2018

2017
Fault-Tolerant Virtual Backbone in Heterogeneous Wireless Sensor Network.
IEEE/ACM Trans. Netw., 2017

A Simpler Method to Obtain a PTAS for Connected k-Path Vertex Cover in Unit Disk Graph.
Proceedings of the Wireless Algorithms, Systems, and Applications, 2017

2016
Approximation algorithms for minimum (weight) connected k-path vertex cover.
Discret. Appl. Math., 2016

Approximation Approximation for Fault-Tolerant Virtual Backbone in Wireless Sensor Networks.
CoRR, 2016

Performance Guaranteed Approximation Algorithm for Minimum $k$-Connected $m$-Fold Dominating Set.
CoRR, 2016

2014
Approximation Algorithm for the Balanced 2-Connected Bipartition Problem.
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

Approximation Algorithm for the Minimum Connected k -Path Vertex Cover Problem.
Proceedings of the Combinatorial Optimization and Applications, 2014

2013
Optimally restricted edge connected elementary Harary graphs.
Theor. Comput. Sci., 2013

A kind of conditional connectivity of Cayley graphs generated by unicyclic graphs.
Inf. Sci., 2013

2012
Diameter Vulnerability of Directed cycles and Directed Tori.
Discret. Math. Algorithms Appl., 2012

2011
Restricted Edge Connectivity of Harary Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2011


  Loading...