Balkanski, Eric; Rubinstein, Aviad; Singer, Yaron An optimal approximation for submodular maximization under a matroid constraint in the adaptive complexity model. (English) Zbl 07625929 Oper. Res. 70, No. 5, 2967-2981 (2022). MSC: 90Cxx PDF BibTeX XML Cite \textit{E. Balkanski} et al., Oper. Res. 70, No. 5, 2967--2981 (2022; Zbl 07625929) Full Text: DOI OpenURL
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 PDF BibTeX XML Cite \textit{W. Hong} et al., Theor. Comput. Sci. 932, 13--20 (2022; Zbl 07584637) Full Text: DOI OpenURL
Barman, Siddharth; Fawzi, Omar; Ghoshal, Suprovat; Gürpınar, Emirhan Tight approximation bounds for maximum multi-coverage. (English) Zbl 07495427 Math. Program. 192, No. 1-2 (B), 443-476 (2022). MSC: 68W25 PDF BibTeX XML Cite \textit{S. Barman} et al., Math. Program. 192, No. 1--2 (B), 443--476 (2022; Zbl 07495427) Full Text: DOI arXiv OpenURL
Badri, Hossein; Bahreini, Tayebeh; Grosu, Daniel A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times. (English) Zbl 07485260 Comput. Oper. Res. 130, Article ID 105238, 10 p. (2021). MSC: 90Bxx PDF BibTeX XML Cite \textit{H. Badri} et al., Comput. Oper. Res. 130, Article ID 105238, 10 p. (2021; Zbl 07485260) Full Text: DOI OpenURL
Ran, Yingli; Zhang, Ying; Zhang, Zhao Parallel approximation for partial set cover. (English) Zbl 07424225 Appl. Math. Comput. 408, Article ID 126358, 9 p. (2021). MSC: 05Cxx 68Wxx PDF BibTeX XML Cite \textit{Y. Ran} et al., Appl. Math. Comput. 408, Article ID 126358, 9 p. (2021; Zbl 07424225) Full Text: DOI OpenURL
Censor-Hillel, Keren; Dory, Michal Distributed spanner approximation. (English) Zbl 1467.05252 SIAM J. Comput. 50, No. 3, 1103-1147 (2021). MSC: 05C85 68W15 68W25 68Q17 68R10 PDF BibTeX XML Cite \textit{K. Censor-Hillel} and \textit{M. Dory}, SIAM J. Comput. 50, No. 3, 1103--1147 (2021; Zbl 1467.05252) Full Text: DOI OpenURL
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 PDF BibTeX XML Cite \textit{Y. Ran} et al., INFORMS J. Comput. 33, No. 2, 774--784 (2021; Zbl 07362346) Full Text: DOI OpenURL
Barman, Siddharth; Fawzi, Omar; Ghoshal, Suprovat; Gürpınar, Emirhan Tight approximation bounds for maximum multi-coverage. (English) Zbl 07602120 Bienstock, Daniel (ed.) et al., Integer programming and combinatorial optimization. 21st international conference, IPCO 2020, London, UK, June 8–10, 2020, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12125, 66-77 (2020). MSC: 90C27 90C59 PDF BibTeX XML Cite \textit{S. Barman} et al., Lect. Notes Comput. Sci. 12125, 66--77 (2020; Zbl 07602120) Full Text: DOI OpenURL
Gorgi, Abbass; El Ouali, Mourad; Srivastav, Anand; Hachimi, Mohamed Approximation of set multi-cover via hypergraph matching. (English) Zbl 1455.68139 Theor. Comput. Sci. 845, 136-143 (2020). MSC: 68R10 05C65 05C70 05C85 68Q17 68W25 68W40 PDF BibTeX XML Cite \textit{A. Gorgi} et al., Theor. Comput. Sci. 845, 136--143 (2020; Zbl 1455.68139) Full Text: DOI OpenURL
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 PDF BibTeX XML Cite \textit{Y. Shi} et al., Theor. Comput. Sci. 803, 1--9 (2020; Zbl 1436.90128) Full Text: DOI arXiv OpenURL
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 PDF BibTeX XML Cite \textit{Y. Shi} et al., J. Glob. Optim. 75, No. 4, 1133--1146 (2019; Zbl 1433.90144) Full Text: DOI arXiv OpenURL
Krumke, Sven O.; Schmidt, Eva; Streicher, Manuel Robust multicovers with budgeted uncertainty. (English) Zbl 1430.90545 Eur. J. Oper. Res. 274, No. 3, 845-857 (2019). MSC: 90C35 90C10 90C27 90C31 PDF BibTeX XML Cite \textit{S. O. Krumke} et al., Eur. J. Oper. Res. 274, No. 3, 845--857 (2019; Zbl 1430.90545) Full Text: DOI arXiv OpenURL
Agarwal, Archita; Chakaravarthy, Venkatesan T.; Choudhury, Anamitra R.; Roy, Sambudha; Sabharwal, Yogish Set cover problems with small neighborhood covers. (English) Zbl 1430.68432 Theory Comput. Syst. 62, No. 8, 1763-1797 (2018). MSC: 68W10 68W15 68W25 68W40 90C27 PDF BibTeX XML Cite \textit{A. Agarwal} et al., Theory Comput. Syst. 62, No. 8, 1763--1797 (2018; Zbl 1430.68432) Full Text: DOI OpenURL
Chen, Zihe; Chen, Danyang; Wang, Xiangyu; Damiano, Robert J.; Meng, Hui; Xu, Jinhui Novel geometric approach for virtual coiling. (English) Zbl 1393.68171 Theor. Comput. Sci. 734, 3-14 (2018). MSC: 68U05 92C50 PDF BibTeX XML Cite \textit{Z. Chen} et al., Theor. Comput. Sci. 734, 3--14 (2018; Zbl 1393.68171) Full Text: DOI Link OpenURL
Liu, Pengcheng; Huang, Xiaohui Approximation algorithm for partial set multicover versus full set multicover. (English) Zbl 1434.68681 Discrete Math. Algorithms Appl. 10, No. 2, Article ID 1850026, 9 p. (2018). MSC: 68W25 90C27 PDF BibTeX XML Cite \textit{P. Liu} and \textit{X. Huang}, Discrete Math. Algorithms Appl. 10, No. 2, Article ID 1850026, 9 p. (2018; Zbl 1434.68681) Full Text: DOI OpenURL
Naszódi, Márton; Polyanskii, Alexandr Approximating set multi-covers. (English) Zbl 1371.05203 Eur. J. Comb. 67, 174-180 (2018). MSC: 05C65 05D15 PDF BibTeX XML Cite \textit{M. Naszódi} and \textit{A. Polyanskii}, Eur. J. Comb. 67, 174--180 (2018; Zbl 1371.05203) Full Text: DOI arXiv Link OpenURL
Guruswami, Venkatesan; Lee, Euiwoong Inapproximability of \(H\)-transversal/packing. (English) Zbl 1371.68099 SIAM J. Discrete Math. 31, No. 3, 1552-1571 (2017). MSC: 68Q17 05C70 68W25 PDF BibTeX XML Cite \textit{V. Guruswami} and \textit{E. Lee}, SIAM J. Discrete Math. 31, No. 3, 1552--1571 (2017; Zbl 1371.68099) Full Text: DOI OpenURL
Shi, Zhengnan A self-stabilizing algorithm to maximal 2-packing with improved complexity. (English) Zbl 1243.68089 Inf. Process. Lett. 112, No. 13, 525-531 (2012). MSC: 68M15 68R10 68M14 PDF BibTeX XML Cite \textit{Z. Shi}, Inf. Process. Lett. 112, No. 13, 525--531 (2012; Zbl 1243.68089) Full Text: DOI OpenURL
Kulik, Ariel; Shachnai, Hadas; Shmueli, Oded; Sayegh, Robert Approximation schemes for deal splitting and covering integer programs with multiplicity constraints. (English) Zbl 1229.90165 Theor. Comput. Sci. 412, No. 52, 7087-7098 (2011). MSC: 90C27 91B26 68W25 90C10 PDF BibTeX XML Cite \textit{A. Kulik} et al., Theor. Comput. Sci. 412, No. 52, 7087--7098 (2011; Zbl 1229.90165) Full Text: DOI OpenURL
Wang, Feng; Du, Hongwei; Camacho, Erika; Xu, Kuai; Lee, Wonjun; Shi, Yan; Shan, Shan On positive influence dominating sets in social networks. (English) Zbl 1233.90272 Theor. Comput. Sci. 412, No. 3, 265-269 (2011). MSC: 90C35 91D30 90C59 90C60 PDF BibTeX XML Cite \textit{F. Wang} et al., Theor. Comput. Sci. 412, No. 3, 265--269 (2011; Zbl 1233.90272) Full Text: DOI OpenURL
Hua, Qiang-Sheng; Wang, Yuexuan; Yu, Dongxiao; Lau, Francis C. M. Dynamic programming based algorithms for set multicover and multiset multicover problems. (English) Zbl 1203.68316 Theor. Comput. Sci. 411, No. 26-28, 2467-2474 (2010). MSC: 68W25 90C39 PDF BibTeX XML Cite \textit{Q.-S. Hua} et al., Theor. Comput. Sci. 411, No. 26--28, 2467--2474 (2010; Zbl 1203.68316) Full Text: DOI Link OpenURL
Hua, Qiang-Sheng; Wang, Yuexuan; Yu, Dongxiao; Lau, Francis C. M. Set multi-covering via inclusion-exclusion. (English) Zbl 1171.68048 Theor. Comput. Sci. 410, No. 38-40, 3882-3892 (2009). MSC: 68W05 68Q25 PDF BibTeX XML Cite \textit{Q.-S. Hua} et al., Theor. Comput. Sci. 410, No. 38--40, 3882--3892 (2009; Zbl 1171.68048) Full Text: DOI OpenURL
Mehta, Aranyak; Roughgarden, Tim; Sundararajan, Mukund Beyond Moulin mechanisms. (English) Zbl 1168.91314 Games Econ. Behav. 67, No. 1, 125-155 (2009). MSC: 91A12 91A20 91B14 PDF BibTeX XML Cite \textit{A. Mehta} et al., Games Econ. Behav. 67, No. 1, 125--155 (2009; Zbl 1168.91314) Full Text: DOI OpenURL
Babaioff, Moshe; Briest, Patrick; Krysta, Piotr On the approximability of combinatorial exchange problems. (English) Zbl 1136.91347 Monien, Burkhard (ed.) et al., Algorithmic game theory. First international symposium, SAGT 2008, Paderborn, Germany, April 30–May 2, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-79308-3/pbk). Lecture Notes in Computer Science 4997, 83-94 (2008). MSC: 91A46 90B05 91B26 PDF BibTeX XML Cite \textit{M. Babaioff} et al., Lect. Notes Comput. Sci. 4997, 83--94 (2008; Zbl 1136.91347) Full Text: DOI OpenURL
Leung, Joseph Y.-T.; Li, Haibing; Pinedo, Michael Scheduling orders for multiple product types with due date related objectives. (English) Zbl 1099.90541 Eur. J. Oper. Res. 168, No. 2, 370-389 (2006). MSC: 90B35 90B30 90C59 PDF BibTeX XML Cite \textit{J. Y. T. Leung} et al., Eur. J. Oper. Res. 168, No. 2, 370--389 (2006; Zbl 1099.90541) Full Text: DOI OpenURL
Kuhn, Fabian; Wattenhofer, Roger Constant-time distributed dominating set approximation. (English) Zbl 1264.68219 Distrib. Comput. 17, No. 4, 303-310 (2005). MSC: 68W15 05C69 PDF BibTeX XML Cite \textit{F. Kuhn} and \textit{R. Wattenhofer}, Distrib. Comput. 17, No. 4, 303--310 (2005; Zbl 1264.68219) Full Text: DOI Link OpenURL
Dubhashi, Devdatt; Mei, Alessandro; Panconesi, Alessandro; Radhakrishnan, Jaikumar; Srinivasan, Aravind Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. (English) Zbl 1085.68184 J. Comput. Syst. Sci. 71, No. 4, 467-479 (2005). MSC: 68W15 PDF BibTeX XML Cite \textit{D. Dubhashi} et al., J. Comput. Syst. Sci. 71, No. 4, 467--479 (2005; Zbl 1085.68184) Full Text: DOI OpenURL
Shi, Zhengnan; Goddard, Wayne; Hedetniemi, Stephen T. An anonymous self-stabilizing algorithm for 1-maximal independent set in trees. (English) Zbl 1178.68384 Inf. Process. Lett. 91, No. 2, 77-83 (2004). MSC: 68R10 05C85 PDF BibTeX XML Cite \textit{Z. Shi} et al., Inf. Process. Lett. 91, No. 2, 77--83 (2004; Zbl 1178.68384) Full Text: DOI OpenURL
Broder, Andrei Z.; Charikar, Moses; Mitzenmacher, Michael A derandomization using min-wise independent permutations. (English) Zbl 1118.68580 J. Discrete Algorithms 1, No. 1, 11-20 (2003). MSC: 68R05 68W99 PDF BibTeX XML Cite \textit{A. Z. Broder} et al., J. Discrete Algorithms 1, No. 1, 11--20 (2003; Zbl 1118.68580) Full Text: DOI OpenURL