default search action
Xiaohui Huang 0001
Person information
- affiliation: Zhejiang Normal University, College of Mathematics Physics and Information Engineering, Jinhua, China
- affiliation: Xinjiang University, College of Mathematics and System Sciences, Urumqi, China
Other persons with the same name
- Xiaohui Huang — disambiguation page
- Xiaohui Huang 0002
— China University of Geosciences, School of Computer Science, Wuhan, China
- Xiaohui Huang 0003
- Xiaohui Huang 0004
- Xiaohui Huang 0005
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j21]Pengcheng Liu, Zhao Zhang
Approximation Algorithm and FPT Algorithm for Connected-k-Subgraph Cover on Minor-Free Graphs. Math. Struct. Comput. Sci. 34(3): 180-192 (2024) - 2022
- [j20]Chaojie Zhu, Xiaohui Huang
A distributed algorithm for a set cover game. Discret. Math. Algorithms Appl. 14(3): 2150127:1-2150127:11 (2022) - [j19]Yingli Ran, Xiaohui Huang, Zhao Zhang, Ding-Zhu Du:
Approximation algorithm for minimum partial multi-cover under a geometric setting. Optim. Lett. 16(2): 667-680 (2022) - [c6]Pengcheng Liu, Zhao Zhang
Computing Connected-k-Subgraph Cover with Connectivity Requirement. TAMC 2022: 93-102 - 2021
- [j18]Yingli Ran, Xiaohui Huang, Zhao Zhang, Ding-Zhu Du:
Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks. J. Glob. Optim. 80(3): 661-677 (2021) - [j17]Wei Liang, Menghong Li, Zhao Zhang, Xiaohui Huang:
Minimum power partial multi-cover on a line. Theor. Comput. Sci. 864: 118-128 (2021) - 2020
- [j16]Pengcheng Liu, Zhao Zhang, Xiaohui Huang:
Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs. Theor. Comput. Sci. 836: 59-64 (2020) - [j15]Pengcheng Liu, Zhao Zhang, Xiaohui Huang:
Approximation algorithm for minimum weight connected-k-subgraph cover. Theor. Comput. Sci. 838: 160-167 (2020)
2010 – 2019
- 2019
- [j14]Yingli Ran, Zhao Zhang
Approximation algorithms for minimum weight connected 3-path vertex cover. Appl. Math. Comput. 347: 723-733 (2019) - [j13]Jian Liang, Xiaohui Huang, Zhao Zhang
Approximation algorithms for distance constraint sweep coverage with base stations. J. Comb. Optim. 37(4): 1111-1125 (2019) - [j12]Zhao Zhang, Zaixin Lu, Xianyue Li, Xiaohui Huang, Ding-Zhu Du:
Online hole healing for sensor coverage. J. Glob. Optim. 75(4): 1111-1131 (2019) - [c5]Pengcheng Liu, Xiaohui Huang
Improved Approximation Algorithm for Minimum Weight k-Subgraph Cover Problem. COCOA 2019: 352-361 - 2018
- [j11]Xiaosong Li, Yishuo Shi, Xiaohui Huang
PTAS for H-free node deletion problems in disk graphs. Discret. Appl. Math. 239: 119-124 (2018) - [j10]Pengcheng Liu, Xiaohui Huang:
Approximation algorithm for partial set multicover versus full set multicover. Discret. Math. Algorithms Appl. 10(2): 1850026:1-1850026:9 (2018) - [j9]Qingqing Chen, Xiaohui Huang, Yingli Ran:
Approximation algorithm for distance constraint sweep coverage without predetermined base stations. Discret. Math. Algorithms Appl. 10(5): 1850064:1-1850064:9 (2018) - [j8]Zhao Zhang
Computing Minimum k-Connected m-Fold Dominating Set in General Graphs. INFORMS J. Comput. 30(2): 217-224 (2018) - [j7]Jiao Zhou, Zhao Zhang
Breaking the O(ln n) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set. INFORMS J. Comput. 30(2): 225-235 (2018) - [j6]Lina Chen, Xiaohui Huang, Zhao Zhang
A simpler PTAS for connected k-path vertex cover in homogeneous wireless sensor network. J. Comb. Optim. 36(1): 35-43 (2018) - 2017
- [j5]Jiao Zhou, Zhao Zhang
Fault-Tolerant Virtual Backbone in Heterogeneous Wireless Sensor Network. IEEE/ACM Trans. Netw. 25(6): 3487-3499 (2017) - [c4]Zhao Zhang, Xiaohui Huang, Lina Chen:
A Simpler Method to Obtain a PTAS for Connected k-Path Vertex Cover in Unit Disk Graph. WASA 2017: 584-592 - 2016
- [j4]Xiaosong Li, Zhao Zhang, Xiaohui Huang:
Approximation algorithms for minimum (weight) connected k-path vertex cover. Discret. Appl. Math. 205: 101-108 (2016) - [i2]Jiao Zhou, Zhao Zhang, Xiaohui Huang, Ding-Zhu Du:
Approximation Approximation for Fault-Tolerant Virtual Backbone in Wireless Sensor Networks. CoRR abs/1604.06181 (2016) - [i1]Zhao Zhang, Jiao Zhou, Xiaohui Huang, Ding-Zhu Du:
Performance Guaranteed Approximation Algorithm for Minimum $k$-Connected $m$-Fold Dominating Set. CoRR abs/1608.07634 (2016) - 2014
- [c3]Xiaosong Li, Zhao Zhang, Xiaohui Huang:
Approximation Algorithm for the Minimum Connected k -Path Vertex Cover Problem. COCOA 2014: 764-771 - [c2]Di Wu, Zhao Zhang, Weili Wu, Xiaohui Huang:
Approximation Algorithm for the Balanced 2-Connected Bipartition Problem. COCOON 2014: 441-452 - 2013
- [j3]Xiangming Yu, Xiaohui Huang, Zhao Zhang:
A kind of conditional connectivity of Cayley graphs generated by unicyclic graphs. Inf. Sci. 243: 86-94 (2013) - [j2]Qinghai Liu, Xiaohui Huang, Zhao Zhang:
Optimally restricted edge connected elementary Harary graphs. Theor. Comput. Sci. 497: 131-138 (2013) - 2012
- [j1]Xiaoyan Ma, Xiaohui Huang, Zhao Zhang:
Diameter Vulnerability of Directed cycles and Directed Tori. Discret. Math. Algorithms Appl. 4(1) (2012) - 2011
- [c1]Qinghai Liu, Xiaohui Huang, Zhao Zhang:
Restricted Edge Connectivity of Harary Graphs. COCOA 2011: 113-125
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 19:37 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: