Fujito, Toshihiro; Mukae, Kneto; Tsuzuki, Junya Approximating power node-deletion problems. (English) Zbl 07745709 Mavronicolas, Marios (ed.), Algorithms and complexity. 13th international conference, CIAC 2023, Larnaca, Cyprus, June 13–16, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13898, 217-231 (2023). MSC: 68Wxx PDFBibTeX XMLCite \textit{T. Fujito} et al., Lect. Notes Comput. Sci. 13898, 217--231 (2023; Zbl 07745709) Full Text: DOI
Benoist, Emile; Fertin, Guillaume; Jean, Géraldine The Exact Subset MultiCover problem. (English) Zbl 07722841 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, 189-200 (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{E. Benoist} et al., Lect. Notes Comput. Sci. 13571, 189--200 (2023; Zbl 07722841) Full Text: DOI
Bandyapadhyay, Sayan Improved bounds for metric capacitated covering problems. (English) Zbl 07704062 Algorithmica 85, No. 7, 1825-1849 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{S. Bandyapadhyay}, Algorithmica 85, No. 7, 1825--1849 (2023; Zbl 07704062) Full Text: DOI
Wei, Hao-Ting; Hon, Wing-Kai; Horn, Paul; Liao, Chung-Shou; Sadakane, Kunihiko Approximating dynamic weighted vertex cover with soft capacities. (English) Zbl 1522.68431 Algorithmica 84, No. 1, 124-149 (2022). MSC: 68R10 05C70 05C85 68W25 PDFBibTeX XMLCite \textit{H.-T. Wei} et al., Algorithmica 84, No. 1, 124--149 (2022; Zbl 1522.68431) Full Text: DOI
Hung, Eunpyeong; Kao, Mong-Jen Approximation algorithm for vertex cover with multiple covering constraints. (English) Zbl 1518.68267 Algorithmica 84, No. 1, 1-12 (2022). MSC: 68R10 05C65 05C70 05C85 68W25 PDFBibTeX XMLCite \textit{E. Hung} and \textit{M.-J. Kao}, Algorithmica 84, No. 1, 1--12 (2022; Zbl 1518.68267) Full Text: DOI Link
Kao, Mong-Jen Iterative partial rounding for vertex cover with hard capacities. (English) Zbl 1508.68266 Algorithmica 83, No. 1, 45-71 (2021). MSC: 68R10 05C65 05C70 68W25 PDFBibTeX XMLCite \textit{M.-J. Kao}, Algorithmica 83, No. 1, 45--71 (2021; Zbl 1508.68266) Full Text: DOI arXiv
Bandyapadhyay, Sayan Improved bounds for metric capacitated covering problems. (English) Zbl 07651148 Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 9, 17 p. (2020). MSC: 68Wxx PDFBibTeX XMLCite \textit{S. Bandyapadhyay}, LIPIcs -- Leibniz Int. Proc. Inform. 173, Article 9, 17 p. (2020; Zbl 07651148) Full Text: DOI arXiv
Mishra, Pawan K.; Jena, Sangram K.; Das, Gautam K.; Rao, S. V. Capacitated discrete unit disk cover. (English) Zbl 1447.05173 Discrete Appl. Math. 285, 242-251 (2020). MSC: 05C70 68Q17 PDFBibTeX XMLCite \textit{P. K. Mishra} et al., Discrete Appl. Math. 285, 242--251 (2020; Zbl 1447.05173) Full Text: DOI
Bandyapadhyay, Sayan; Bhowmick, Santanu; Inamdar, Tanmay; Varadarajan, Kasturi Capacitated covering problems in geometric spaces. (English) Zbl 1435.68338 Discrete Comput. Geom. 63, No. 4, 768-798 (2020). MSC: 68U05 68W25 90C05 PDFBibTeX XMLCite \textit{S. Bandyapadhyay} et al., Discrete Comput. Geom. 63, No. 4, 768--798 (2020; Zbl 1435.68338) Full Text: DOI arXiv Link
Khuller, Samir; Purohit, Manish; Sarpatwar, Kanthi K. Analyzing the optimal neighborhood: algorithms for partial and budgeted connected dominating set problems. (English) Zbl 1436.68399 SIAM J. Discrete Math. 34, No. 1, 251-270 (2020). MSC: 68W25 05C69 05C85 68W40 PDFBibTeX XMLCite \textit{S. Khuller} et al., SIAM J. Discrete Math. 34, No. 1, 251--270 (2020; Zbl 1436.68399) Full Text: DOI
Haney, Samuel; Liaee, Mehraneh; Maggs, Bruce M.; Panigrahi, Debmalya; Rajaraman, Rajmohan; Sundaram, Ravi Retracting graphs to cycles. (English) Zbl 07561563 Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 70, 15 p. (2019). MSC: 68Nxx 68Qxx PDFBibTeX XMLCite \textit{S. Haney} et al., LIPIcs -- Leibniz Int. Proc. Inform. 132, Article 70, 15 p. (2019; Zbl 07561563) Full Text: DOI arXiv
Kao, Mong-Jen; Shiau, Jia-Yau; Lin, Ching-Chi; Lee, D. T. Tight approximation for partial vertex cover with hard capacities. (English) Zbl 1423.68594 Theor. Comput. Sci. 778, 61-72 (2019). MSC: 68W25 05C65 05C70 PDFBibTeX XMLCite \textit{M.-J. Kao} et al., Theor. Comput. Sci. 778, 61--72 (2019; Zbl 1423.68594) Full Text: DOI Link
Kao, Mong-Jen; Tu, Hai-Lun; Lee, D. T. \(O(f)\) bi-criteria approximation for capacitated covering with hard capacities. (English) Zbl 1421.68232 Algorithmica 81, No. 5, 1800-1817 (2019). MSC: 68W25 68R10 PDFBibTeX XMLCite \textit{M.-J. Kao} et al., Algorithmica 81, No. 5, 1800--1817 (2019; Zbl 1421.68232) Full Text: DOI
Hong, Eunpyeong; Kao, Mong-Jen Approximation algorithm for vertex cover with multiple covering constraints. (English) Zbl 1518.68266 Hsu, Wen-Lian (ed.) et al., 29th international symposium on algorithms and computation, ISAAC 2018, December 16–19, 2018, Jiaoxi, Yilan, Taiwan. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 123, Article 43, 11 p. (2018). MSC: 68R10 05C65 05C70 05C85 68W25 PDFBibTeX XMLCite \textit{E. Hong} and \textit{M.-J. Kao}, LIPIcs -- Leibniz Int. Proc. Inform. 123, Article 43, 11 p. (2018; Zbl 1518.68266) Full Text: DOI
Bandyapadhyay, Sayan; Bhowmick, Santanu; Inamdar, Tanmay; Varadarajan, Kasturi Capacitated covering problems in geometric spaces. (English) Zbl 1489.68337 Speckmann, Bettina (ed.) et al., 34th international symposium on computational geometry, SoCG 2018, June 11–14, 2018, Budapest, Hungary. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 99, Article 7, 15 p. (2018). MSC: 68U05 68W25 PDFBibTeX XMLCite \textit{S. Bandyapadhyay} et al., LIPIcs -- Leibniz Int. Proc. Inform. 99, Article 7, 15 p. (2018; Zbl 1489.68337) Full Text: DOI
Shiau, Jia-Yau; Kao, Mong-Jen; Lin, Ching-Chi; Lee, D. T. Tight approximation for partial vertex cover with hard capacities. (English) Zbl 1457.68312 Okamoto, Yoshio (ed.) et al., 28th international symposium on algorithms and computation, ISAAC 2017, December 9–12, 2017, Phuket, Thailand. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 92, Article 64, 13 p. (2017). MSC: 68W25 05C65 05C70 PDFBibTeX XMLCite \textit{J.-Y. Shiau} et al., LIPIcs -- Leibniz Int. Proc. Inform. 92, Article 64, 13 p. (2017; Zbl 1457.68312) Full Text: DOI
Jasin, Stefanus; Sinha, Amitabh An LP-based correlated rounding scheme for multi-item ecommerce order fulfillment. (English) Zbl 1333.90058 Oper. Res. 63, No. 6, 1336-1351 (2015). MSC: 90B36 90C05 90C59 PDFBibTeX XMLCite \textit{S. Jasin} and \textit{A. Sinha}, Oper. Res. 63, No. 6, 1336--1351 (2015; Zbl 1333.90058) Full Text: DOI
Carnes, Tim; Shmoys, David B. Primal-dual schema for capacitated covering problems. (English) Zbl 1327.90252 Math. Program. 153, No. 2 (A), 289-308 (2015). MSC: 90C27 90C05 90B05 PDFBibTeX XMLCite \textit{T. Carnes} and \textit{D. B. Shmoys}, Math. Program. 153, No. 2 (A), 289--308 (2015; Zbl 1327.90252) Full Text: DOI
Kao, Mong-Jen; Chen, Han-Lin; Lee, D. T. Capacitated domination: problem complexity and approximation algorithms. (English) Zbl 1311.68189 Algorithmica 72, No. 1, 1-43 (2015). MSC: 68W25 05C69 05C85 68Q17 68Q25 PDFBibTeX XMLCite \textit{M.-J. Kao} et al., Algorithmica 72, No. 1, 1--43 (2015; Zbl 1311.68189) Full Text: DOI
Doerr, Benjamin; Wahlström, Magnus Randomized rounding in the presence of a cardinality constraint. (English) Zbl 1347.68361 ACM J. Exp. Algorithm. 19, Article No. 1.2, 18 p. (2014). MSC: 68W20 68W25 PDFBibTeX XMLCite \textit{B. Doerr} and \textit{M. Wahlström}, ACM J. Exp. Algorithm. 19, Article No. 1.2, 18 p. (2014; Zbl 1347.68361) Full Text: DOI
Ghasemi, Taha; Ghasemalizadeh, Hossein; Razzazi, Mohammadreza An algorithmic framework for solving geometric covering problems – with applications. (English) Zbl 1302.68287 Int. J. Found. Comput. Sci. 25, No. 5, 623-639 (2014). MSC: 68U05 68W25 52C17 52C15 PDFBibTeX XMLCite \textit{T. Ghasemi} et al., Int. J. Found. Comput. Sci. 25, No. 5, 623--639 (2014; Zbl 1302.68287) Full Text: DOI
Ghasemi, Taha; Razzazi, Mohammadreza A PTAS for the cardinality constrained covering with unit balls. (English) Zbl 1282.68194 Theor. Comput. Sci. 527, 50-60 (2014). MSC: 68W25 68U05 90C39 52C17 PDFBibTeX XMLCite \textit{T. Ghasemi} and \textit{M. Razzazi}, Theor. Comput. Sci. 527, 50--60 (2014; Zbl 1282.68194) Full Text: DOI
Rawitz, Dror; Shahar, Shimon (Moni) Capacitated Arc Stabbing. (English) Zbl 1267.90164 J. Discrete Algorithms 17, 86-94 (2012). MSC: 90C35 PDFBibTeX XMLCite \textit{D. Rawitz} and \textit{S. Shahar}, J. Discrete Algorithms 17, 86--94 (2012; Zbl 1267.90164) Full Text: DOI
Kao, Mong-Jen; Liao, Chung-Shou; Lee, D. T. Capacitated domination problem. (English) Zbl 1213.05194 Algorithmica 60, No. 2, 274-300 (2011). MSC: 05C69 05C85 68Q17 68W25 PDFBibTeX XMLCite \textit{M.-J. Kao} et al., Algorithmica 60, No. 2, 274--300 (2011; Zbl 1213.05194) Full Text: DOI
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 PDFBibTeX XMLCite \textit{Q.-S. Hua} et al., Theor. Comput. Sci. 411, No. 26--28, 2467--2474 (2010; Zbl 1203.68316) Full Text: DOI Link
Hochbaum, Dorit S.; Levin, Asaf The multi-integer set cover and the facility terminal cover problem. (English) Zbl 1168.90536 Networks 53, No. 1, 63-66 (2009). MSC: 90B80 68W25 90C27 PDFBibTeX XMLCite \textit{D. S. Hochbaum} and \textit{A. Levin}, Networks 53, No. 1, 63--66 (2009; Zbl 1168.90536) Full Text: DOI
Carnes, Tim; Shmoys, David Primal-dual schema for capacitated covering problems. (English) Zbl 1143.90375 Lodi, Andrea (ed.) et al., Integer programming and combinatorial optimization. 13th international conference, IPCO 2008 Bertinoro, Italy, May 26–28, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-68886-0/pbk). Lecture Notes in Computer Science 5035, 288-302 (2008). MSC: 90C27 68W25 90C59 PDFBibTeX XMLCite \textit{T. Carnes} and \textit{D. Shmoys}, Lect. Notes Comput. Sci. 5035, 288--302 (2008; Zbl 1143.90375) Full Text: DOI
Dom, Michael; Lokshtanov, Daniel; Saurabh, Saket; Villanger, Yngve Capacitated domination and covering: A parameterized perspective. (English) Zbl 1142.68371 Grohe, Martin (ed.) et al., Parameterized and exact computation. Third international workshop, IWPEC 2008, Victoria, Canada, May 14–16, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-79722-7/pbk). Lecture Notes in Computer Science 5018, 78-90 (2008). MSC: 68Q25 68Q17 68R10 PDFBibTeX XMLCite \textit{M. Dom} et al., Lect. Notes Comput. Sci. 5018, 78--90 (2008; Zbl 1142.68371) Full Text: DOI
Kao, Mong-Jen; Liao, Chung-Shou Capacitated domination problem. (English) Zbl 1193.05127 Tokuyama, Takeshi (ed.), Algorithms and computation. 18th international symposium, ISAAC 2007, Sendai, Japan, December 17–19, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-77118-0/pbk). Lecture Notes in Computer Science 4835, 256-267 (2007). MSC: 05C69 05C85 68Q17 68W25 PDFBibTeX XMLCite \textit{M.-J. Kao} and \textit{C.-S. Liao}, Lect. Notes Comput. Sci. 4835, 256--267 (2007; Zbl 1193.05127) Full Text: DOI