Liang, Wei; Zhang, Zhao; Du, Ding-Zhu A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems. (English) Zbl 07814901 Optim. Lett. 18, No. 2, 575-589 (2024). MSC: 90Cxx PDFBibTeX XMLCite \textit{W. Liang} et al., Optim. Lett. 18, No. 2, 575--589 (2024; Zbl 07814901) Full Text: DOI
Li, Ke; Zhang, Zhao Approximation algorithm for (connected) Italian dominating function. (English) Zbl 1526.05109 Discrete Appl. Math. 341, 169-179 (2023). MSC: 05C69 05C85 68W25 05C40 PDFBibTeX XMLCite \textit{K. Li} and \textit{Z. Zhang}, Discrete Appl. Math. 341, 169--179 (2023; Zbl 1526.05109) Full Text: DOI
Liu, Pengcheng; Zhang, Zhao; Ran, Yingli; Huang, Xiaohui Computing connected-\(k\)-subgraph cover with connectivity requirement. (English) Zbl 07722834 Du, Ding-Zhu (ed.) et al., Theory and applications of models of computation. 17th annual conference, TAMC 2022, Tianjin, China, September 16–18, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13571, 93-102 (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{P. Liu} et al., Lect. Notes Comput. Sci. 13571, 93--102 (2023; Zbl 07722834) Full Text: DOI
Zhang, Yaoyao; Zhang, Zhao; Du, Ding-Zhu Construction of minimum edge-fault tolerant connected dominating set in a general graph. (English) Zbl 1516.90076 J. Comb. Optim. 45, No. 2, Paper No. 63, 12 p. (2023). MSC: 90C27 PDFBibTeX XMLCite \textit{Y. Zhang} et al., J. Comb. Optim. 45, No. 2, Paper No. 63, 12 p. (2023; Zbl 1516.90076) Full Text: DOI
Zhang, Zhao; Liang, Wei; Du, Hongmin W.; Liu, Siwen Constant approximation for the lifetime scheduling problem of \(p\)-percent coverage. (English) Zbl 1502.90081 INFORMS J. Comput. 34, No. 5, 2675-2685 (2022). MSC: 90B35 PDFBibTeX XMLCite \textit{Z. Zhang} et al., INFORMS J. Comput. 34, No. 5, 2675--2685 (2022; Zbl 1502.90081) Full Text: DOI
Li, Xianyue; Yang, Ruowang; Zhang, Heping; Zhang, Zhao Partial inverse maximum spanning tree problem under the Chebyshev norm. (English) Zbl 1505.90108 J. Comb. Optim. 44, No. 5, 3331-3350 (2022). MSC: 90C27 90C35 PDFBibTeX XMLCite \textit{X. Li} et al., J. Comb. Optim. 44, No. 5, 3331--3350 (2022; Zbl 1505.90108) Full Text: DOI
Li, Ke; Ran, Yingli; Zhang, Zhao; Du, Ding-Zhu Nearly tight approximation algorithm for (connected) Roman dominating set. (English) Zbl 1503.90150 Optim. Lett. 16, No. 8, 2261-2276 (2022). MSC: 90C35 PDFBibTeX XMLCite \textit{K. Li} et al., Optim. Lett. 16, No. 8, 2261--2276 (2022; Zbl 1503.90150) Full Text: DOI
Li, Menghong; Ran, Yingli; Zhang, Zhao A primal-dual algorithm for the minimum power partial cover problem. (English) Zbl 1502.90152 J. Comb. Optim. 44, No. 3, 1913-1923 (2022). MSC: 90C27 90C35 90C59 PDFBibTeX XMLCite \textit{M. Li} et al., J. Comb. Optim. 44, No. 3, 1913--1923 (2022; Zbl 1502.90152) Full Text: DOI
Hong, Weizhi; Ran, Yingli; Zhang, Zhao Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph. (English) Zbl 07584637 Theor. Comput. Sci. 932, 13-20 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{W. Hong} et al., Theor. Comput. Sci. 932, 13--20 (2022; Zbl 07584637) Full Text: DOI
Liang, Wei; Zhang, Zhao Approximation algorithm for prize-collecting sweep cover with base stations. (English) Zbl 07575076 Theor. Comput. Sci. 929, 1-10 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{W. Liang} and \textit{Z. Zhang}, Theor. Comput. Sci. 929, 1--10 (2022; Zbl 07575076) Full Text: DOI
Ran, Yingli; Huang, Xiaohui; Zhang, Zhao; Du, Ding-Zhu Approximation algorithm for minimum partial multi-cover under a geometric setting. (English) Zbl 1487.90566 Optim. Lett. 16, No. 2, 667-680 (2022). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{Y. Ran} et al., Optim. Lett. 16, No. 2, 667--680 (2022; Zbl 1487.90566) Full Text: DOI
Liang, Wei; Zhang, Zhao Constant-approximation for prize-collecting min-sensor sweep coverage with base stations. (English) Zbl 1498.68040 Wu, Weili (ed.) et al., Algorithmic aspects in information and management. 15th international conference, AAIM 2021, virtual event, December 20–22, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13153, 3-14 (2021). MSC: 68M18 68W25 90C27 90C59 PDFBibTeX XMLCite \textit{W. Liang} and \textit{Z. Zhang}, Lect. Notes Comput. Sci. 13153, 3--14 (2021; Zbl 1498.68040) Full Text: DOI
Hong, Weizhi; Zhang, Zhao; Ran, Yingli Parallel algorithm for minimum partial dominating set in unit disk graph. (English) Zbl 07550549 Du, Ding-Zhu (ed.) et al., Combinatorial optimization and applications. 15th international conference, COCOA 2021, Tianjin, China, December 17–19, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13135, 527-537 (2021). MSC: 68T20 90C27 PDFBibTeX XMLCite \textit{W. Hong} et al., Lect. Notes Comput. Sci. 13135, 527--537 (2021; Zbl 07550549) Full Text: DOI
Li, Xianyue; Yang, Ruowang; Zhang, Heping; Zhang, Zhao Capacitated partial inverse maximum spanning tree under the weighted \(l_{\infty }\)-norm. (English) Zbl 07550539 Du, Ding-Zhu (ed.) et al., Combinatorial optimization and applications. 15th international conference, COCOA 2021, Tianjin, China, December 17–19, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13135, 389-399 (2021). MSC: 68T20 90C27 PDFBibTeX XMLCite \textit{X. Li} et al., Lect. Notes Comput. Sci. 13135, 389--399 (2021; Zbl 07550539) Full Text: DOI
Ran, Yingli; Zhang, Ying; Zhang, Zhao Parallel approximation for partial set cover. (English) Zbl 1510.68117 Appl. Math. Comput. 408, Article ID 126358, 9 p. (2021). MSC: 68W10 68W25 90C27 PDFBibTeX XMLCite \textit{Y. Ran} et al., Appl. Math. Comput. 408, Article ID 126358, 9 p. (2021; Zbl 1510.68117) Full Text: DOI
Ran, Yingli; Huang, Xiaohui; Zhang, Zhao; Du, Ding-Zhu Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks. (English) Zbl 1475.90085 J. Glob. Optim. 80, No. 3, 661-677 (2021). MSC: 90C27 90B18 PDFBibTeX XMLCite \textit{Y. Ran} et al., J. Glob. Optim. 80, No. 3, 661--677 (2021; Zbl 1475.90085) Full Text: DOI
Ran, Yingli; Zhang, Zhao; Tang, Shaojie; Du, Ding-Zhu Breaking the \(r_{\max}\) barrier: enhanced approximation algorithms for partial set multicover problem. (English) Zbl 07362346 INFORMS J. Comput. 33, No. 2, 774-784 (2021). MSC: 90Cxx PDFBibTeX XMLCite \textit{Y. Ran} et al., INFORMS J. Comput. 33, No. 2, 774--784 (2021; Zbl 07362346) Full Text: DOI
Liang, Wei; Li, Menghong; Zhang, Zhao; Huang, Xiaohui Minimum power partial multi-cover on a line. (English) Zbl 1501.90044 Theor. Comput. Sci. 864, 118-128 (2021). MSC: 90B80 68Q25 90C05 90C39 PDFBibTeX XMLCite \textit{W. Liang} et al., Theor. Comput. Sci. 864, 118--128 (2021; Zbl 1501.90044) Full Text: DOI
Liu, Pengcheng; Zhang, Zhao; Li, Xianyue; Wu, Weili Approximation algorithm for minimum connected 3-path vertex cover. (English) Zbl 1448.05164 Discrete Appl. Math. 287, 77-84 (2020). MSC: 05C70 05C85 05C40 68W25 PDFBibTeX XMLCite \textit{P. Liu} et al., Discrete Appl. Math. 287, 77--84 (2020; Zbl 1448.05164) Full Text: DOI
Liu, Pengcheng; Zhang, Zhao; Huang, Xiaohui Approximation algorithm for minimum weight connected-\(k\)-subgraph cover. (English) Zbl 1453.68140 Theor. Comput. Sci. 838, 160-167 (2020). MSC: 68R10 05C70 05C85 68W25 90C27 PDFBibTeX XMLCite \textit{P. Liu} et al., Theor. Comput. Sci. 838, 160--167 (2020; Zbl 1453.68140) Full Text: DOI
Liu, Pengcheng; Zhang, Zhao; Huang, Xiaohui Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs. (English) Zbl 1452.68139 Theor. Comput. Sci. 836, 59-64 (2020). MSC: 68R10 05C22 05C62 68W25 PDFBibTeX XMLCite \textit{P. Liu} et al., Theor. Comput. Sci. 836, 59--64 (2020; Zbl 1452.68139) Full Text: DOI
Chen, Xiuyang; Zhang, Zhao A game theoretic approach for minimal connected dominating set. (English) Zbl 1455.05053 Theor. Comput. Sci. 836, 29-36 (2020). MSC: 05C69 05C57 05C40 91A43 PDFBibTeX XMLCite \textit{X. Chen} and \textit{Z. Zhang}, Theor. Comput. Sci. 836, 29--36 (2020; Zbl 1455.05053) Full Text: DOI
Li, Xianyue; Zhang, Zhao; Yang, Ruowang; Zhang, Heping; Du, Ding-Zhu Approximation algorithms for capacitated partial inverse maximum spanning tree problem. (English) Zbl 1442.90196 J. Glob. Optim. 77, No. 2, 319-340 (2020). MSC: 90C35 90C59 PDFBibTeX XMLCite \textit{X. Li} et al., J. Glob. Optim. 77, No. 2, 319--340 (2020; Zbl 1442.90196) Full Text: DOI
Ran, Yingli; Shi, Yishuo; Tang, Changbing; Zhang, Zhao A primal-dual algorithm for the minimum partial set multi-cover problem. (English) Zbl 1441.90141 J. Comb. Optim. 39, No. 3, 725-746 (2020). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{Y. Ran} et al., J. Comb. Optim. 39, No. 3, 725--746 (2020; Zbl 1441.90141) Full Text: DOI
Shi, Yishuo; Ran, Yingli; Zhang, Zhao; Du, Ding-Zhu A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem. (English) Zbl 1436.90128 Theor. Comput. Sci. 803, 1-9 (2020). MSC: 90C27 68W25 90C59 PDFBibTeX XMLCite \textit{Y. Shi} et al., Theor. Comput. Sci. 803, 1--9 (2020; Zbl 1436.90128) Full Text: DOI arXiv
Shi, Yishuo; Ran, Yingli; Zhang, Zhao; Willson, James; Tong, Guangmo; Du, Ding-Zhu Approximation algorithm for the partial set multi-cover problem. (English) Zbl 1433.90144 J. Glob. Optim. 75, No. 4, 1133-1146 (2019). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{Y. Shi} et al., J. Glob. Optim. 75, No. 4, 1133--1146 (2019; Zbl 1433.90144) Full Text: DOI arXiv
Ran, Yingli; Zhang, Zhao; Huang, Xiaohui; Li, Xiaosong; Du, Ding-Zhu Approximation algorithms for minimum weight connected 3-path vertex cover. (English) Zbl 1428.05297 Appl. Math. Comput. 347, 723-733 (2019). MSC: 05C85 05C70 PDFBibTeX XMLCite \textit{Y. Ran} et al., Appl. Math. Comput. 347, 723--733 (2019; Zbl 1428.05297) Full Text: DOI
Wu, Wei-Li; Zhang, Zhao; Du, Ding-Zhu Set function optimization. (English) Zbl 1438.90002 J. Oper. Res. Soc. China 7, No. 2, 183-193 (2019). MSC: 90-02 PDFBibTeX XMLCite \textit{W.-L. Wu} et al., J. Oper. Res. Soc. China 7, No. 2, 183--193 (2019; Zbl 1438.90002) Full Text: DOI
Zhou, Jiao; Zhang, Zhao; Tang, Shaojie; Huang, Xiaohui; Du, Ding-Zhu Breaking the \(o(\ln n)\) barrier: an enhanced approximation algorithm for fault-tolerant minimum weight connected dominating set. (English) Zbl 1528.90234 INFORMS J. Comput. 30, No. 2, 225-235 (2018). MSC: 90C27 05C69 68M15 68W25 PDFBibTeX XMLCite \textit{J. Zhou} et al., INFORMS J. Comput. 30, No. 2, 225--235 (2018; Zbl 1528.90234) Full Text: DOI
Zhang, Zhao; Zhou, Jiao; Tang, Shaojie; Huang, Xiaohui; Du, Ding-Zhu Computing minimum \(k\)-connected \(m\)-fold dominating set in general graphs. (English) Zbl 1528.05053 INFORMS J. Comput. 30, No. 2, 217-224 (2018). MSC: 05C69 90C59 68W25 PDFBibTeX XMLCite \textit{Z. Zhang} et al., INFORMS J. Comput. 30, No. 2, 217--224 (2018; Zbl 1528.05053) Full Text: DOI
Chen, Lina; Huang, Xiaohui; Zhang, Zhao A simpler PTAS for connected \(k\)-path vertex cover in homogeneous wireless sensor network. (English) Zbl 1402.90139 J. Comb. Optim. 36, No. 1, 35-43 (2018). MSC: 90C27 90C35 PDFBibTeX XMLCite \textit{L. Chen} et al., J. Comb. Optim. 36, No. 1, 35--43 (2018; Zbl 1402.90139) Full Text: DOI
Li, Xianyue; Zhang, Zhao; Du, Ding-Zhu Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm. (English) Zbl 1393.90104 J. Glob. Optim. 70, No. 3, 677-685 (2018). MSC: 90C27 90C60 PDFBibTeX XMLCite \textit{X. Li} et al., J. Glob. Optim. 70, No. 3, 677--685 (2018; Zbl 1393.90104) Full Text: DOI
Zhang, Yubai; Ran, Yingli; Zhang, Zhao A simple approximation algorithm for minimum weight partial connected set cover. (English) Zbl 1383.90036 J. Comb. Optim. 34, No. 3, 956-963 (2017). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{Y. Zhang} et al., J. Comb. Optim. 34, No. 3, 956--963 (2017; Zbl 1383.90036) Full Text: DOI
Ran, Yingli; Shi, Yishuo; Zhang, Zhao Local ratio method on partial set multi-cover. (English) Zbl 1383.90034 J. Comb. Optim. 34, No. 1, 302-313 (2017). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{Y. Ran} et al., J. Comb. Optim. 34, No. 1, 302--313 (2017; Zbl 1383.90034) Full Text: DOI
Wang, Limin; Du, Wenxue; Zhang, Zhao; Zhang, Xiaoyan A PTAS for minimum weighted connected vertex cover \(P_3\) problem in 3-dimensional wireless sensor networks. (English) Zbl 1366.90204 J. Comb. Optim. 33, No. 1, 106-122 (2017). MSC: 90C35 90C59 PDFBibTeX XMLCite \textit{L. Wang} et al., J. Comb. Optim. 33, No. 1, 106--122 (2017; Zbl 1366.90204) Full Text: DOI
Ran, Yingli; Zhang, Zhao; Du, Hongwei; Zhu, Yuqing Approximation algorithm for partial positive influence problem in social network. (English) Zbl 1361.90064 J. Comb. Optim. 33, No. 2, 791-802 (2017). MSC: 90C35 90C59 91D30 PDFBibTeX XMLCite \textit{Y. Ran} et al., J. Comb. Optim. 33, No. 2, 791--802 (2017; Zbl 1361.90064) Full Text: DOI
Zhang, Zhao; Li, Xiaoting; Shi, Yishuo; Nie, Hongmei; Zhu, Yuqing PTAS for minimum \(k\)-path vertex cover in ball graph. (English) Zbl 1401.68365 Inf. Process. Lett. 119, 9-13 (2017). MSC: 68W25 05C70 05C85 PDFBibTeX XMLCite \textit{Z. Zhang} et al., Inf. Process. Lett. 119, 9--13 (2017; Zbl 1401.68365) Full Text: DOI
Zhang, Zhao; Lee, Joong-Lyul; Wu, Weili; Du, Ding-Zhu Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs. (English) Zbl 1355.90103 Optim. Lett. 10, No. 7, 1393-1401 (2016). MSC: 90C35 90C59 PDFBibTeX XMLCite \textit{Z. Zhang} et al., Optim. Lett. 10, No. 7, 1393--1401 (2016; Zbl 1355.90103) Full Text: DOI
Liu, Zhenhua; Zhang, Zhao Restricted connectivity of total digraph. (English) Zbl 1342.05056 Discrete Math. Algorithms Appl. 8, No. 2, Article ID 1650022, 9 p. (2016). MSC: 05C20 05C40 PDFBibTeX XMLCite \textit{Z. Liu} and \textit{Z. Zhang}, Discrete Math. Algorithms Appl. 8, No. 2, Article ID 1650022, 9 p. (2016; Zbl 1342.05056) Full Text: DOI
Li, Shuangshuang; Zhang, Zhao; Lai, Hong-Jian Algorithm for constraint partial inverse matroid problem with weight increase forbidden. (English) Zbl 1345.05011 Theor. Comput. Sci. 640, 119-124 (2016). MSC: 05B35 68W05 90C27 PDFBibTeX XMLCite \textit{S. Li} et al., Theor. Comput. Sci. 640, 119--124 (2016; Zbl 1345.05011) Full Text: DOI
Ran, Yingli; Zhang, Zhao; Ko, Ker-I; Liang, Jun An approximation algorithm for maximum weight budgeted connected set cover. (English) Zbl 1347.90074 J. Comb. Optim. 31, No. 4, 1505-1517 (2016). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{Y. Ran} et al., J. Comb. Optim. 31, No. 4, 1505--1517 (2016; Zbl 1347.90074) Full Text: DOI
Li, Xiaosong; Zhang, Zhao; Huang, Xiaohui Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover. (English) Zbl 1333.05168 Discrete Appl. Math. 205, 101-108 (2016). MSC: 05C40 05C38 05C05 68W25 68Q25 PDFBibTeX XMLCite \textit{X. Li} et al., Discrete Appl. Math. 205, 101--108 (2016; Zbl 1333.05168) Full Text: DOI
Liang, Dongyue; Zhang, Zhao; Liu, Xianliang; Wang, Wei; Jiang, Yaolin Approximation algorithms for minimum weight partial connected set cover problem. (English) Zbl 1360.90224 J. Comb. Optim. 31, No. 2, 696-712 (2016). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{D. Liang} et al., J. Comb. Optim. 31, No. 2, 696--712 (2016; Zbl 1360.90224) Full Text: DOI
Shi, Yishuo; Zhang, Yaping; Zhang, Zhao; Wu, Weili A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem. (English) Zbl 1341.90118 J. Comb. Optim. 31, No. 1, 136-151 (2016). MSC: 90C27 90C35 90C59 PDFBibTeX XMLCite \textit{Y. Shi} et al., J. Comb. Optim. 31, No. 1, 136--151 (2016; Zbl 1341.90118) Full Text: DOI
Wu, Di; Zhang, Zhao; Wu, Weili Approximation algorithm for the balanced 2-connected \(k\)-partition problem. (English) Zbl 1333.68298 Theor. Comput. Sci. 609, Part 3, 627-638 (2016). MSC: 68W25 05C62 05C70 05C85 PDFBibTeX XMLCite \textit{D. Wu} et al., Theor. Comput. Sci. 609, Part 3, 627--638 (2016; Zbl 1333.68298) Full Text: DOI
Wang, Limin; Zhang, Xiaoyan; Zhang, Zhao; Broersma, Hajo A PTAS for the minimum weight connected vertex cover \(P_3\) problem on unit disk graphs. (English) Zbl 1312.68234 Theor. Comput. Sci. 571, 58-66 (2015). MSC: 68W25 05C62 05C70 05C85 68Q17 PDFBibTeX XMLCite \textit{L. Wang} et al., Theor. Comput. Sci. 571, 58--66 (2015; Zbl 1312.68234) Full Text: DOI
Li, Xiaosong; Zhang, Zhao; Huang, Xiaohui Approximation algorithm for the minimum connected \(k\)-path vertex cover problem. (English) Zbl 1433.05300 Zhang, Zhao (ed.) et al., Combinatorial optimization and applications. 8th international conference, COCOA 2014, Wailea, Maui, HI, USA, December 19–21, 2014. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 8881, 764-771 (2014). MSC: 05C85 90C35 68W25 PDFBibTeX XMLCite \textit{X. Li} et al., Lect. Notes Comput. Sci. 8881, 764--771 (2014; Zbl 1433.05300) Full Text: DOI
Zhou, Jiao; Zhang, Zhao; Wu, Weili; Xing, Kai A greedy algorithm for the fault-tolerant connected dominating set in a general graph. (English) Zbl 1298.90122 J. Comb. Optim. 28, No. 1, 310-319 (2014). MSC: 90C35 PDFBibTeX XMLCite \textit{J. Zhou} et al., J. Comb. Optim. 28, No. 1, 310--319 (2014; Zbl 1298.90122) Full Text: DOI
Yu, Xiangming; Huang, Xiaohui; Zhang, Zhao A kind of conditional connectivity of Cayley graphs generated by unicyclic graphs. (English) Zbl 1337.68214 Inf. Sci. 243, 86-94 (2013). MSC: 68R10 05C25 05C40 68M15 PDFBibTeX XMLCite \textit{X. Yu} et al., Inf. Sci. 243, 86--94 (2013; Zbl 1337.68214) Full Text: DOI
Liu, Qinghai; Zhang, Zhao; Hong, Yanmei; Wu, Weili; Du, Ding-Zhu A PTAS for weak minimum routing cost connected dominating set of unit disk graph. (English) Zbl 1308.90188 Chinchuluun, Altannar (ed.) et al., Optimization, simulation, and control. New York, NY: Springer (ISBN 978-1-4614-5130-3/hbk; 978-1-4614-5131-0/ebook). Springer Optimization and Its Applications 76, 131-142 (2013). MSC: 90C35 PDFBibTeX XMLCite \textit{Q. Liu} et al., Springer Optim. Appl. 76, 131--142 (2013; Zbl 1308.90188) Full Text: DOI
Liu, Qinghai; Huang, Xiaohui; Zhang, Zhao Optimally restricted edge connected elementary Harary graphs. (English) Zbl 1420.05091 Theor. Comput. Sci. 497, 131-138 (2013). MSC: 05C40 PDFBibTeX XMLCite \textit{Q. Liu} et al., Theor. Comput. Sci. 497, 131--138 (2013; Zbl 1420.05091) Full Text: DOI
Huang, Da; Zhang, Zhao On cyclic vertex-connectivity of Cartesian product digraphs. (English) Zbl 1282.90213 J. Comb. Optim. 24, No. 3, 379-388 (2012). MSC: 90C35 PDFBibTeX XMLCite \textit{D. Huang} and \textit{Z. Zhang}, J. Comb. Optim. 24, No. 3, 379--388 (2012; Zbl 1282.90213) Full Text: DOI
Ma, Wenkai; Li, Deying; Zhang, Zhao Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem. (English) Zbl 1244.90234 J. Comb. Optim. 23, No. 4, 528-540 (2012). MSC: 90C35 90C27 PDFBibTeX XMLCite \textit{W. Ma} et al., J. Comb. Optim. 23, No. 4, 528--540 (2012; Zbl 1244.90234) Full Text: DOI
Zhang, Wei; Zhang, Zhao; Wang, Wei; Zou, Feng; Lee, Wonjun Polynomial time approximation scheme for \(t\)-latency bounded information propagation problem in wireless networks. (English) Zbl 1245.90016 J. Comb. Optim. 23, No. 4, 451-461 (2012). MSC: 90B18 90C59 PDFBibTeX XMLCite \textit{W. Zhang} et al., J. Comb. Optim. 23, No. 4, 451--461 (2012; Zbl 1245.90016) Full Text: DOI
Tian, Yingzhi; Meng, Jixiang; Zhang, Zhao On the connectivity of \(p\)-diamond-free vertex transitive graphs. (English) Zbl 1242.05148 Discrete Appl. Math. 160, No. 7-8, 1285-1290 (2012). MSC: 05C40 PDFBibTeX XMLCite \textit{Y. Tian} et al., Discrete Appl. Math. 160, No. 7--8, 1285--1290 (2012; Zbl 1242.05148) Full Text: DOI
Hong, Yanmei; Meng, Jixiang; Zhang, Zhao Edge fault tolerance of graphs with respect to super edge connectivity. (English) Zbl 1239.05108 Discrete Appl. Math. 160, No. 4-5, 579-587 (2012). MSC: 05C40 05C76 PDFBibTeX XMLCite \textit{Y. Hong} et al., Discrete Appl. Math. 160, No. 4--5, 579--587 (2012; Zbl 1239.05108) Full Text: DOI
Liu, Qinghai; Zhang, Zhao; Yu, Zhihua Cyclic connectivity of star graph. (English) Zbl 1247.05123 Discrete Math. Algorithms Appl. 3, No. 4, 433-442 (2011). MSC: 05C40 PDFBibTeX XMLCite \textit{Q. Liu} et al., Discrete Math. Algorithms Appl. 3, No. 4, 433--442 (2011; Zbl 1247.05123) Full Text: DOI
Cheng, Eddie; Lipták, László; Yang, Weihua; Zhang, Zhao; Guo, Xiaofeng A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees. (English) Zbl 1244.05111 Inf. Sci. 181, No. 19, 4300-4308 (2011). MSC: 05C25 05C40 PDFBibTeX XMLCite \textit{E. Cheng} et al., Inf. Sci. 181, No. 19, 4300--4308 (2011; Zbl 1244.05111) Full Text: DOI
Yang, Weihua; Zhang, Zhao; Qin, Chengfu; Guo, Xiaofeng On super 2-restricted and 3-restricted edge-connected vertex transitive graphs. (English) Zbl 1238.05135 Discrete Math. 311, No. 23-24, 2683-2689 (2011). MSC: 05C25 05C40 PDFBibTeX XMLCite \textit{W. Yang} et al., Discrete Math. 311, No. 23--24, 2683--2689 (2011; Zbl 1238.05135) Full Text: DOI
Fan, Lidan; Zhang, Zhao; Wang, Wei PTAS for minimum weighted connected vertex cover problem with \(c\)-local condition in unit disk graphs. (English) Zbl 1236.90135 J. Comb. Optim. 22, No. 4, 663-673 (2011). MSC: 90C35 90C27 PDFBibTeX XMLCite \textit{L. Fan} et al., J. Comb. Optim. 22, No. 4, 663--673 (2011; Zbl 1236.90135) Full Text: DOI
Zhang, Zhao; Wang, Bing Super cyclically edge connected transitive graphs. (English) Zbl 1263.90119 J. Comb. Optim. 22, No. 4, 549-562 (2011). MSC: 90C35 PDFBibTeX XMLCite \textit{Z. Zhang} and \textit{B. Wang}, J. Comb. Optim. 22, No. 4, 549--562 (2011; Zbl 1263.90119) Full Text: DOI
Zhang, Zhao; Xiong, Wei; Yang, Weihua A kind of conditional fault tolerance of alternating group graphs. (English) Zbl 1379.68263 Inf. Process. Lett. 110, No. 22, 998-1002 (2010). MSC: 68R10 05C25 05C40 68M15 PDFBibTeX XMLCite \textit{Z. Zhang} et al., Inf. Process. Lett. 110, No. 22, 998--1002 (2010; Zbl 1379.68263) Full Text: DOI
Li, Xiuying; Zhang, Zhao Two algorithms for minimum 2-connected \(r\)-hop dominating set. (English) Zbl 1379.68355 Inf. Process. Lett. 110, No. 22, 986-991 (2010). MSC: 68W25 05C69 05C85 PDFBibTeX XMLCite \textit{X. Li} and \textit{Z. Zhang}, Inf. Process. Lett. 110, No. 22, 986--991 (2010; Zbl 1379.68355) Full Text: DOI
Zhang, Zhao; Liu, Qinghai Sufficient conditions for a graph to be \(\lambda_k\)-optimal with given girth and diameter. (English) Zbl 1205.05132 Networks 55, No. 2, 119-124 (2010). MSC: 05C40 05C12 05C35 PDFBibTeX XMLCite \textit{Z. Zhang} and \textit{Q. Liu}, Networks 55, No. 2, 119--124 (2010; Zbl 1205.05132) Full Text: DOI
Liu, Juan; Meng, Jixiang; Zhang, Zhao Double-super-connected digraphs. (English) Zbl 1230.05190 Discrete Appl. Math. 158, No. 9, 1012-1016 (2010). MSC: 05C40 05C20 05C76 PDFBibTeX XMLCite \textit{J. Liu} et al., Discrete Appl. Math. 158, No. 9, 1012--1016 (2010; Zbl 1230.05190) Full Text: DOI
Liu, Qinghai; Zhang, Zhao The existence and upper bound for two types of restricted connectivity. (English) Zbl 1221.05223 Discrete Appl. Math. 158, No. 5, 516-521 (2010). MSC: 05C40 PDFBibTeX XMLCite \textit{Q. Liu} and \textit{Z. Zhang}, Discrete Appl. Math. 158, No. 5, 516--521 (2010; Zbl 1221.05223) Full Text: DOI
Zhang, Zhao; Liu, Qinghai; Li, Deying Two algorithms for connected \(r\)-hop \(k\)-dominating set. (English) Zbl 1184.68649 Discrete Math. Algorithms Appl. 1, No. 4, 485-498 (2009). MSC: 68W25 PDFBibTeX XMLCite \textit{Z. Zhang} et al., Discrete Math. Algorithms Appl. 1, No. 4, 485--498 (2009; Zbl 1184.68649) Full Text: DOI
Hong, Yanmei; Zhang, Zhao; Liu, Qinghai Edges of degree \(k\) in minimally restricted \(k\)-edge connected graphs. (English) Zbl 1239.05109 Discrete Math. 309, No. 13, 4448-4455 (2009). MSC: 05C40 05C35 PDFBibTeX XMLCite \textit{Y. Hong} et al., Discrete Math. 309, No. 13, 4448--4455 (2009; Zbl 1239.05109) Full Text: DOI
Liu, Qinghai; Hong, Yanmei; Zhang, Zhao Minimally 3-restricted edge connected graphs. (English) Zbl 1173.05337 Discrete Appl. Math. 157, No. 4, 685-690 (2009). MSC: 05C40 05C35 PDFBibTeX XMLCite \textit{Q. Liu} et al., Discrete Appl. Math. 157, No. 4, 685--690 (2009; Zbl 1173.05337) Full Text: DOI
Meng, Jixiang; Zhang, Zhao Super-connected arc-transitive digraphs. (English) Zbl 1173.05326 Discrete Appl. Math. 157, No. 4, 653-658 (2009). MSC: 05C20 05C40 05C25 05C38 PDFBibTeX XMLCite \textit{J. Meng} and \textit{Z. Zhang}, Discrete Appl. Math. 157, No. 4, 653--658 (2009; Zbl 1173.05326) Full Text: DOI
Zhang, Zhao Semi-hyper-connected vertex transitive graphs. (English) Zbl 1169.05006 Discrete Math. 309, No. 4, 899-907 (2009). MSC: 05A15 PDFBibTeX XMLCite \textit{Z. Zhang}, Discrete Math. 309, No. 4, 899--907 (2009; Zbl 1169.05006) Full Text: DOI
Hong, Yanmei; Liu, Qinghai; Zhang, Zhao Minimally restricted edge connected graphs. (English) Zbl 1180.05058 Appl. Math. Lett. 21, No. 8, 820-823 (2008). MSC: 05C40 PDFBibTeX XMLCite \textit{Y. Hong} et al., Appl. Math. Lett. 21, No. 8, 820--823 (2008; Zbl 1180.05058) Full Text: DOI
Zhang, Zhao Extra edge connectivity and isoperimetric edge connectivity. (English) Zbl 1155.05039 Discrete Math. 308, No. 20, 4560-4569 (2008). Reviewer: Lutz Volkmann (Aachen) MSC: 05C40 05C35 PDFBibTeX XMLCite \textit{Z. Zhang}, Discrete Math. 308, No. 20, 4560--4569 (2008; Zbl 1155.05039) Full Text: DOI
Zhang, Zhao Sufficient conditions for restricted-edge-connectivity to be optimal. (English) Zbl 1134.05047 Discrete Math. 307, No. 22, 2891-2899 (2007). Reviewer: Linda Lesniak (Madison) MSC: 05C40 PDFBibTeX XMLCite \textit{Z. Zhang}, Discrete Math. 307, No. 22, 2891--2899 (2007; Zbl 1134.05047) Full Text: DOI
Liang, Xiaodong; Meng, Jixiang; Zhang, Zhao Super-connectivity and hyper-connectivity of vertex transitive bipartite graphs. (English) Zbl 1122.05052 Graphs Comb. 23, No. 3, 309-314 (2007). MSC: 05C40 05C25 PDFBibTeX XMLCite \textit{X. Liang} et al., Graphs Comb. 23, No. 3, 309--314 (2007; Zbl 1122.05052) Full Text: DOI
Zhang, Zhao; Yuan, Jinjiang Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal. (English) Zbl 1177.05067 Discrete Math. 307, No. 2, 293-298 (2007). MSC: 05C40 PDFBibTeX XMLCite \textit{Z. Zhang} and \textit{J. Yuan}, Discrete Math. 307, No. 2, 293--298 (2007; Zbl 1177.05067) Full Text: DOI