Disser, Yann; Weckbecker, David Unified greedy approximability beyond submodular maximization. (English) Zbl 07793143 SIAM J. Discrete Math. 38, No. 1, 348-379 (2024). MSC: 68W25 90C27 68Q25 PDFBibTeX XMLCite \textit{Y. Disser} and \textit{D. Weckbecker}, SIAM J. Discrete Math. 38, No. 1, 348--379 (2024; Zbl 07793143) Full Text: DOI
Husić, Edin; Koh, Zhuan Khye; Loho, Georg; Végh, László A. On the correlation gap of matroids. (English) Zbl 1528.05012 Del Pia, Alberto (ed.) et al., Integer programming and combinatorial optimization. 24th international conference, IPCO 2023, Madison, WI, USA, June 21–23, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13904, 203-216 (2023). MSC: 05B35 90C27 91B03 PDFBibTeX XMLCite \textit{E. Husić} et al., Lect. Notes Comput. Sci. 13904, 203--216 (2023; Zbl 1528.05012) Full Text: DOI arXiv
Feng, Junkai; Yang, Ruiqi; Zhang, Haibin; Zhang, Zhenning A bi-criteria algorithm for online non-monotone maximization problems: DR-submodular+concave. (English) Zbl 07755524 Theor. Comput. Sci. 979, Article ID 114207, 10 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{J. Feng} et al., Theor. Comput. Sci. 979, Article ID 114207, 10 p. (2023; Zbl 07755524) Full Text: DOI
Yang, Yongge; Chen, Po-An; Lee, Yu-Ching; Fanchiang, Yung-Yan On the firefighter problem with spreading vaccination for maximizing the number of saved nodes: the IP model and LP rounding algorithms. (English) Zbl 07755344 Optim. Lett. 17, No. 8, 1853-1872 (2023). MSC: 90C10 90C59 90C90 PDFBibTeX XMLCite \textit{Y. Yang} et al., Optim. Lett. 17, No. 8, 1853--1872 (2023; Zbl 07755344) Full Text: DOI
Ganesh, Arun; Maggs, Bruce M.; Panigrahi, Debmalya Universal algorithms for clustering problems. (English) Zbl 07753166 ACM Trans. Algorithms 19, No. 2, Article No. 15, 46 p. (2023). MSC: 68-XX PDFBibTeX XMLCite \textit{A. Ganesh} et al., ACM Trans. Algorithms 19, No. 2, Article No. 15, 46 p. (2023; Zbl 07753166) Full Text: DOI arXiv
Dror, Amitay; Feldman, Michal; Segal-Halevi, Erel On fair division under heterogeneous matroid constraints. (English) Zbl 07732091 J. Artif. Intell. Res. (JAIR) 76, 567-611 (2023). MSC: 68Txx PDFBibTeX XMLCite \textit{A. Dror} et al., J. Artif. Intell. Res. (JAIR) 76, 567--611 (2023; Zbl 07732091) Full Text: DOI arXiv
Buchbinder, Niv; Feldman, Moran; Garg, Mohit Deterministic \((1/2+\varepsilon)\)-approximation for submodular maximization over a matroid. (English) Zbl 07725041 SIAM J. Comput. 52, No. 4, 945-967 (2023). MSC: 68Q87 68W25 68R05 PDFBibTeX XMLCite \textit{N. Buchbinder} et al., SIAM J. Comput. 52, No. 4, 945--967 (2023; Zbl 07725041) Full Text: DOI
Feng, Junkai; Yang, Ruiqi; Zhang, Haibin; Zhang, Zhenning Online non-monotone DR-submodular maximization: 1/4 approximation ratio and sublinear regret. (English) Zbl 07724738 Zhang, Yong (ed.) et al., Computing and combinatorics. 28th international conference, COCOON 2022, Shenzhen, China, October 22–24, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13595, 118-125 (2023). MSC: 68Rxx PDFBibTeX XMLCite \textit{J. Feng} et al., Lect. Notes Comput. Sci. 13595, 118--125 (2023; Zbl 07724738) Full Text: DOI
Jiang, Hongyi; Samaranayake, Samitha Approximation algorithms for capacitated assignment with budget constraints and applications in transportation systems. (English) Zbl 07724736 Zhang, Yong (ed.) et al., Computing and combinatorics. 28th international conference, COCOON 2022, Shenzhen, China, October 22–24, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13595, 94-105 (2023). MSC: 68Rxx PDFBibTeX XMLCite \textit{H. Jiang} and \textit{S. Samaranayake}, Lect. Notes Comput. Sci. 13595, 94--105 (2023; Zbl 07724736) Full Text: DOI arXiv
Liu, Zhicheng; Jin, Jing; Du, Donglei; Zhang, Xiaoyan Two-stage submodular maximization under knapsack and matroid constraints. (English) Zbl 07722838 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, 140-154 (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{Z. Liu} et al., Lect. Notes Comput. Sci. 13571, 140--154 (2023; Zbl 07722838) Full Text: DOI
Ye, Lintao; Liu, Zhi-Wei; Chi, Ming; Gupta, Vijay Maximization of nonsubmodular functions under multiple constraints with applications. (English) Zbl 1520.93560 Automatica 155, Article ID 111126, 10 p. (2023). MSC: 93E10 93E11 90C27 68W25 PDFBibTeX XMLCite \textit{L. Ye} et al., Automatica 155, Article ID 111126, 10 p. (2023; Zbl 1520.93560) Full Text: DOI arXiv
Lu, Cheng; Yang, Wenguo; Gao, Suixiang Streaming algorithms for maximizing the difference of submodular functions and the sum of submodular and supermodular functions. (English) Zbl 07720219 Optim. Lett. 17, No. 7, 1643-1667 (2023). MSC: 90C27 PDFBibTeX XMLCite \textit{C. Lu} et al., Optim. Lett. 17, No. 7, 1643--1667 (2023; Zbl 07720219) Full Text: DOI
D’Angelo, Gianlorenzo; Poddar, Debashmita; Vinci, Cosimo Better bounds on the adaptivity gap of influence maximization under full-adoption feedback. (English) Zbl 07702935 Artif. Intell. 318, Article ID 103895, 20 p. (2023). MSC: 68Txx PDFBibTeX XMLCite \textit{G. D'Angelo} et al., Artif. Intell. 318, Article ID 103895, 20 p. (2023; Zbl 07702935) Full Text: DOI arXiv
Huang, Chien-Chung; Ward, Justin FPT-algorithms for the \(\ell\)-matchoid problem with a coverage objective. (English) Zbl 07700271 SIAM J. Discrete Math. 37, No. 2, 1053-1078 (2023). MSC: 68W40 68W27 PDFBibTeX XMLCite \textit{C.-C. Huang} and \textit{J. Ward}, SIAM J. Discrete Math. 37, No. 2, 1053--1078 (2023; Zbl 07700271) Full Text: DOI arXiv
Huang, Chien-Chung; Sellier, François Matroid-constrained vertex cover. (English) Zbl 1522.68406 Theor. Comput. Sci. 965, Article ID 113977, 19 p. (2023). MSC: 68R10 05B35 05C22 68W25 90C27 PDFBibTeX XMLCite \textit{C.-C. Huang} and \textit{F. Sellier}, Theor. Comput. Sci. 965, Article ID 113977, 19 p. (2023; Zbl 1522.68406) Full Text: DOI arXiv
Ramachandra, Arjun Kodagehalli; Natarajan, Karthik Tight probability bounds with pairwise independence. (English) Zbl 1524.60005 SIAM J. Discrete Math. 37, No. 2, 516-555 (2023). MSC: 60-08 60C05 60E15 90C05 PDFBibTeX XMLCite \textit{A. K. Ramachandra} and \textit{K. Natarajan}, SIAM J. Discrete Math. 37, No. 2, 516--555 (2023; Zbl 1524.60005) Full Text: DOI arXiv
Weber, Melanie; Sra, Suvrit Riemannian optimization via Frank-Wolfe methods. (English) Zbl 1522.46052 Math. Program. 199, No. 1-2 (A), 525-556 (2023). MSC: 46N10 15A24 65K10 49Q99 PDFBibTeX XMLCite \textit{M. Weber} and \textit{S. Sra}, Math. Program. 199, No. 1--2 (A), 525--556 (2023; Zbl 1522.46052) Full Text: DOI arXiv
Feldman, Moran; Nutov, Zeev; Shoham, Elad Practical budgeted submodular maximization. (English) Zbl 07680778 Algorithmica 85, No. 5, 1332-1371 (2023). MSC: 68Wxx 05Cxx 68W25 68R05 PDFBibTeX XMLCite \textit{M. Feldman} et al., Algorithmica 85, No. 5, 1332--1371 (2023; Zbl 07680778) Full Text: DOI arXiv
Yu, Kemin; Li, Min; Zhou, Yang; Liu, Qian On maximizing monotone or non-monotone \(k\)-submodular functions with the intersection of knapsack and matroid constraints. (English) Zbl 1517.90129 J. Comb. Optim. 45, No. 3, Paper No. 93, 21 p. (2023). MSC: 90C27 68W40 68W25 PDFBibTeX XMLCite \textit{K. Yu} et al., J. Comb. Optim. 45, No. 3, Paper No. 93, 21 p. (2023; Zbl 1517.90129) Full Text: DOI
Shi, Majun; Yang, Zishen; Wang, Wei Greedy guarantees for non-submodular function maximization under independent system constraint with applications. (English) Zbl 1517.90127 J. Optim. Theory Appl. 196, No. 2, 516-543 (2023). MSC: 90C27 90C30 PDFBibTeX XMLCite \textit{M. Shi} et al., J. Optim. Theory Appl. 196, No. 2, 516--543 (2023; Zbl 1517.90127) Full Text: DOI
Bérczi, Kristóf; Chandrasekaran, Karthekeyan; Király, Tamás; Pillai, Aditya Analyzing Residual Random Greedy for monotone submodular maximization. (English) Zbl 07647063 Inf. Process. Lett. 180, Article ID 106340, 11 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{K. Bérczi} et al., Inf. Process. Lett. 180, Article ID 106340, 11 p. (2023; Zbl 07647063) Full Text: DOI
Soma, Tasuku; Yoshida, Yuichi Online risk-averse submodular maximization. (English) Zbl 1512.91176 Ann. Oper. Res. 320, No. 1, 393-414 (2023). MSC: 91G70 93E20 68W27 PDFBibTeX XMLCite \textit{T. Soma} and \textit{Y. Yoshida}, Ann. Oper. Res. 320, No. 1, 393--414 (2023; Zbl 1512.91176) Full Text: DOI arXiv
Gong, Suning; Nong, Qingqin; Bao, Shuyu; Fang, Qizhi; Du, Ding-Zhu A fast and deterministic algorithm for knapsack-constrained monotone DR-submodular maximization over an integer lattice. (English) Zbl 1511.90347 J. Glob. Optim. 85, No. 1, 15-38 (2023). MSC: 90C27 68W25 68W40 PDFBibTeX XMLCite \textit{S. Gong} et al., J. Glob. Optim. 85, No. 1, 15--38 (2023; Zbl 1511.90347) Full Text: DOI
Sun, Xin; Xu, Dachuan; Zhang, Dongmei; Zhou, Yang An adaptive algorithm for maximization of non-submodular function with a matroid constraint. (English) Zbl 1513.90159 J. Ind. Manag. Optim. 19, No. 3, 2050-2070 (2023). MSC: 90C27 68W25 90C59 PDFBibTeX XMLCite \textit{X. Sun} et al., J. Ind. Manag. Optim. 19, No. 3, 2050--2070 (2023; Zbl 1513.90159) Full Text: DOI
Karakostas, George; Kolliopoulos, Stavros G. Resource time-sharing for IoT applications with deadlines. (English) Zbl 07722894 Erlebach, Thomas (ed.) et al., Algorithmics of wireless networks. 18th international symposium on algorithmics of wireless networks, ALGOSENSORS 2022, Potsdam, Germany, September 8–9, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13707, 91-107 (2022). MSC: 68M18 68T40 PDFBibTeX XMLCite \textit{G. Karakostas} and \textit{S. G. Kolliopoulos}, Lect. Notes Comput. Sci. 13707, 91--107 (2022; Zbl 07722894) Full Text: DOI
Disser, Yann; Weckbecker, David Unified greedy approximability beyond submodular maximization. (English) Zbl 1528.90214 Ljubić, Ivana (ed.) et al., Combinatorial optimization. 7th international symposium, ISCO 2022, virtual event, May 18–20, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13526, 299-311 (2022). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{Y. Disser} and \textit{D. Weckbecker}, Lect. Notes Comput. Sci. 13526, 299--311 (2022; Zbl 1528.90214) Full Text: DOI arXiv
Yu, Kemin; Li, Min; Zhou, Yang; Liu, Qian Guarantees for maximization of \(k\)-submodular functions with a knapsack and a matroid constraint. (English) Zbl 1527.90192 Ni, Qiufen (ed.) et al., Algorithmic aspects in information and management. 16th international conference, AAIM 2022, Guangzhou, China, August 13–14, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13513, 156-167 (2022). MSC: 90C27 68W25 90C59 PDFBibTeX XMLCite \textit{K. Yu} et al., Lect. Notes Comput. Sci. 13513, 156--167 (2022; Zbl 1527.90192) Full Text: DOI
Ha, Dung T. K.; Pham, Canh V.; Hoang, Huan X. Submodular maximization subject to a knapsack constraint under noise models. (English) Zbl 1517.90122 Asia-Pac. J. Oper. Res. 39, No. 6, Article ID 2250013, 26 p. (2022). MSC: 90C27 PDFBibTeX XMLCite \textit{D. T. K. Ha} et al., Asia-Pac. J. Oper. Res. 39, No. 6, Article ID 2250013, 26 p. (2022; Zbl 1517.90122) Full Text: DOI
Alaluf, Naor; Ene, Alina; Feldman, Moran; Nguyen, Huy L.; Suh, Andrew An optimal streaming algorithm for submodular maximization with a cardinality constraint. (English) Zbl 1510.90217 Math. Oper. Res. 47, No. 4, 2667-2690 (2022). MSC: 90C27 68W27 PDFBibTeX XMLCite \textit{N. Alaluf} et al., Math. Oper. Res. 47, No. 4, 2667--2690 (2022; Zbl 1510.90217) Full Text: DOI arXiv
Sun, Xin; Li, Gaidi; Zhang, Yapu; Zhang, Zhenning Private non-monotone submodular maximization. (English) Zbl 1505.90112 J. Comb. Optim. 44, No. 5, 3212-3232 (2022). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{X. Sun} et al., J. Comb. Optim. 44, No. 5, 3212--3232 (2022; Zbl 1505.90112) Full Text: DOI
Tang, Shaojie Stochastic submodular probing with state-dependent costs. (English) Zbl 07605945 Theor. Comput. Sci. 937, 63-68 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{S. Tang}, Theor. Comput. Sci. 937, 63--68 (2022; Zbl 07605945) Full Text: DOI
Li, Min; Xiao, Hao; Liu, Qian; Zhou, Yang The submodularity of two-stage stochastic maximum-weight independent set problems. (English) Zbl 07605944 Theor. Comput. Sci. 937, 50-62 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{M. Li} et al., Theor. Comput. Sci. 937, 50--62 (2022; Zbl 07605944) Full Text: DOI
Tan, Jingjing; Wang, Fengmin; Ye, Weina; Zhang, Xiaoqing; Zhou, Yang Streaming algorithms for monotone non-submodular function maximization under a knapsack constraint on the integer lattice. (English) Zbl 07605943 Theor. Comput. Sci. 937, 39-49 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{J. Tan} et al., Theor. Comput. Sci. 937, 39--49 (2022; Zbl 07605943) Full Text: DOI
Pham, Canh V.; Vu, Quang C.; Ha, Dung K. T.; Nguyen, Tai T.; Le, Nguyen D. Maximizing \(k\)-submodular functions under budget constraint: applications and streaming algorithms. (English) Zbl 1498.90199 J. Comb. Optim. 44, No. 1, 723-751 (2022). MSC: 90C27 PDFBibTeX XMLCite \textit{C. V. Pham} et al., J. Comb. Optim. 44, No. 1, 723--751 (2022; Zbl 1498.90199) Full Text: DOI
Chekuri, Chandra; Inamdar, Tanmay; Quanrud, Kent; Varadarajan, Kasturi; Zhang, Zhao Algorithms for covering multiple submodular constraints and applications. (English) Zbl 1497.90165 J. Comb. Optim. 44, No. 2, 979-1010 (2022). MSC: 90C27 PDFBibTeX XMLCite \textit{C. Chekuri} et al., J. Comb. Optim. 44, No. 2, 979--1010 (2022; Zbl 1497.90165) Full Text: DOI
Rahgoshay, Mirmahdi; Salavatipour, Mohammad R. Asymptotic quasi-polynomial time approximation scheme for resource minimization for fire containment. (English) Zbl 07572790 Algorithmica 84, No. 9, 2462-2479 (2022). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{M. Rahgoshay} and \textit{M. R. Salavatipour}, Algorithmica 84, No. 9, 2462--2479 (2022; Zbl 07572790) Full Text: DOI
Han, Shaoning; Gómez, Andrés; Prokopyev, Oleg A. Fractional 0-1 programming and submodularity. (English) Zbl 1496.90101 J. Glob. Optim. 84, No. 1, 77-93 (2022). MSC: 90C32 90C10 PDFBibTeX XMLCite \textit{S. Han} et al., J. Glob. Optim. 84, No. 1, 77--93 (2022; Zbl 1496.90101) Full Text: DOI arXiv
Lu, Cheng; Yang, Wenguo; Yang, Ruiqi; Gao, Suixiang Maximizing a non-decreasing non-submodular function subject to various types of constraints. (English) Zbl 1495.90139 J. Glob. Optim. 83, No. 4, 727-751 (2022). MSC: 90C26 90C59 PDFBibTeX XMLCite \textit{C. Lu} et al., J. Glob. Optim. 83, No. 4, 727--751 (2022; Zbl 1495.90139) Full Text: DOI
Zhang, Zhenning; Liu, Bin; Wang, Yishui; Xu, Dachuan; Zhang, Dongmei Maximizing a monotone non-submodular function under a knapsack constraint. (English) Zbl 1495.90169 J. Comb. Optim. 43, No. 5, 1125-1148 (2022). MSC: 90C27 PDFBibTeX XMLCite \textit{Z. Zhang} et al., J. Comb. Optim. 43, No. 5, 1125--1148 (2022; Zbl 1495.90169) Full Text: DOI
Maehara, Takanori; Nakashima, So; Yamaguchi, Yutaro Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice – continuous greedy algorithm on median complex –. (English) Zbl 1494.90098 Math. Program. 194, No. 1-2 (A), 85-119 (2022). MSC: 90C27 68W25 PDFBibTeX XMLCite \textit{T. Maehara} et al., Math. Program. 194, No. 1--2 (A), 85--119 (2022; Zbl 1494.90098) Full Text: DOI arXiv
Harshaw, Christopher; Kazemi, Ehsan; Feldman, Moran; Karbasi, Amin The power of subsampling in submodular maximization. (English) Zbl 1492.68141 Math. Oper. Res. 47, No. 2, 1365-1393 (2022). MSC: 68W20 68W25 68W27 90C27 PDFBibTeX XMLCite \textit{C. Harshaw} et al., Math. Oper. Res. 47, No. 2, 1365--1393 (2022; Zbl 1492.68141) Full Text: DOI arXiv
Berger, Mathias; Radu, David; Dubois, Antoine; Pandžić, Hrvoje; Dvorkin, Yury; Louveaux, Quentin; Ernst, Damien Siting renewable power generation assets with combinatorial optimisation. (English) Zbl 1489.90148 Optim. Lett. 16, No. 3, 877-907 (2022). MSC: 90C27 90C90 PDFBibTeX XMLCite \textit{M. Berger} et al., Optim. Lett. 16, No. 3, 877--907 (2022; Zbl 1489.90148) Full Text: DOI Link
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 PDFBibTeX XMLCite \textit{S. Barman} et al., Math. Program. 192, No. 1--2 (B), 443--476 (2022; Zbl 07495427) Full Text: DOI arXiv
Bruggmann, Simon; Zenklusen, Rico An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint. (English) Zbl 1489.90149 Math. Program. 191, No. 2 (A), 795-845 (2022). MSC: 90C27 68W20 68W25 PDFBibTeX XMLCite \textit{S. Bruggmann} and \textit{R. Zenklusen}, Math. Program. 191, No. 2 (A), 795--845 (2022; Zbl 1489.90149) Full Text: DOI arXiv
Huang, Chien-Chung; Kakimura, Naonori Multi-pass streaming algorithms for monotone submodular function maximization. (English) Zbl 07473212 Theory Comput. Syst. 66, No. 1, 354-394 (2022). MSC: 68Wxx 90Cxx 68Qxx PDFBibTeX XMLCite \textit{C.-C. Huang} and \textit{N. Kakimura}, Theory Comput. Syst. 66, No. 1, 354--394 (2022; Zbl 07473212) Full Text: DOI arXiv
Huang, Chien-Chung; Kakimura, Naonori; Mauras, Simon; Yoshida, Yuichi Approximability of monotone submodular function maximization under cardinality and matroid constraints in the streaming model. (English) Zbl 07471553 SIAM J. Discrete Math. 36, No. 1, 355-382 (2022). MSC: 68W25 68W27 90C27 PDFBibTeX XMLCite \textit{C.-C. Huang} et al., SIAM J. Discrete Math. 36, No. 1, 355--382 (2022; Zbl 07471553) Full Text: DOI arXiv
Fairstein, Yaron; Kulik, Ariel; Naor, Joseph (Seffi); Raz, Danny; Shachnai, Hadas An almost optimal approximation algorithm for monotone submodular multiple knapsack. (English) Zbl 07466702 J. Comput. Syst. Sci. 125, 149-165 (2022). MSC: 68-XX PDFBibTeX XMLCite \textit{Y. Fairstein} et al., J. Comput. Syst. Sci. 125, 149--165 (2022; Zbl 07466702) Full Text: DOI arXiv
Benabbou, Nawal; Leroy, Cassandre; Lust, Thibaut; Perny, Patrice Interactive optimization of submodular functions under matroid constraints. (English) Zbl 07670914 Fotakis, Dimitris (ed.) et al., Algorithmic decision theory. 7th international conference, ADT 2021, Toulouse, France, November 3–5, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13023, 307-322 (2021). MSC: 68T20 91B06 91B14 91B32 91B68 PDFBibTeX XMLCite \textit{N. Benabbou} et al., Lect. Notes Comput. Sci. 13023, 307--322 (2021; Zbl 07670914) Full Text: DOI
Cellinese, Francesco; D’Angelo, Gianlorenzo; Monaco, Gianpiero; Velaj, Yllka The multi-budget maximum weighted coverage problem. (English) Zbl 07667129 Calamoneri, Tiziana (ed.) et al., Algorithms and complexity. 12th international conference, CIAC 2021, virtual event, May 10–12, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12701, 173-186 (2021). MSC: 68Wxx PDFBibTeX XMLCite \textit{F. Cellinese} et al., Lect. Notes Comput. Sci. 12701, 173--186 (2021; Zbl 07667129) Full Text: DOI
Sun, Xin; Li, Gaidi; Zhang, Yapu; Zhang, Zhenning Measured continuous greedy with differential privacy. (English) Zbl 1498.90203 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, 212-226 (2021). MSC: 90C27 68P27 68W25 90C59 PDFBibTeX XMLCite \textit{X. Sun} et al., Lect. Notes Comput. Sci. 13153, 212--226 (2021; Zbl 1498.90203) Full Text: DOI
Tang, Shaojie Stochastic submodular probing with state-dependent costs. (English) Zbl 1503.90121 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, 170-178 (2021). MSC: 90C27 PDFBibTeX XMLCite \textit{S. Tang}, Lect. Notes Comput. Sci. 13153, 170--178 (2021; Zbl 1503.90121) Full Text: DOI arXiv
Gong, Qinqin; Gao, Suixiang; Wang, Fengmin; Yang, Ruiqi A multi-pass streaming algorithm for regularized submodular maximization. (English) Zbl 07550563 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, 701-711 (2021). MSC: 68T20 90C27 PDFBibTeX XMLCite \textit{Q. Gong} et al., Lect. Notes Comput. Sci. 13135, 701--711 (2021; Zbl 07550563) Full Text: DOI
Tan, Jingjing; Wang, Fengmin; Zhang, Xiaoqing; Zhou, Yang Maximization of monotone non-submodular functions with a knapsack constraint over the integer lattice. (English) Zbl 07550537 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, 364-373 (2021). MSC: 68T20 90C27 PDFBibTeX XMLCite \textit{J. Tan} et al., Lect. Notes Comput. Sci. 13135, 364--373 (2021; Zbl 07550537) Full Text: DOI
Li, Min; Liu, Qian; Zhou, Yang Two-stage stochastic max-weight independent set problems. (English) Zbl 07550525 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, 203-213 (2021). MSC: 68T20 90C27 PDFBibTeX XMLCite \textit{M. Li} et al., Lect. Notes Comput. Sci. 13135, 203--213 (2021; Zbl 07550525) Full Text: DOI
Torrico, Alfredo; Singh, Mohit; Pokutta, Sebastian; Haghtalab, Nika; Naor, Joseph Seffi; Anari, Nima Structured robust submodular maximization: offline and online algorithms. (English) Zbl 07549352 INFORMS J. Comput. 33, No. 4, 1590-1607 (2021). MSC: 90-XX PDFBibTeX XMLCite \textit{A. Torrico} et al., INFORMS J. Comput. 33, No. 4, 1590--1607 (2021; Zbl 07549352) Full Text: DOI arXiv
Lee, Jongmin; Kim, Gwang; Moon, Ilkyeong A mobile multi-agent sensing problem with submodular functions under a partition matroid. (English) Zbl 1510.90310 Comput. Oper. Res. 132, Article ID 105265, 11 p. (2021). MSC: 90C90 90C27 PDFBibTeX XMLCite \textit{J. Lee} et al., Comput. Oper. Res. 132, Article ID 105265, 11 p. (2021; Zbl 1510.90310) Full Text: DOI
Beyhaghi, Hedyeh; Golrezaei, Negin; Leme, Renato Paes; Pál, Martin; Sivan, Balasubramanian Improved revenue bounds for posted-price and second-price mechanisms. (English) Zbl 1484.91207 Oper. Res. 69, No. 6, 1805-1822 (2021). MSC: 91B26 90B60 PDFBibTeX XMLCite \textit{H. Beyhaghi} et al., Oper. Res. 69, No. 6, 1805--1822 (2021; Zbl 1484.91207) Full Text: DOI arXiv
Filmus, Yuval; Kawase, Yasushi; Kobayashi, Yusuke; Yamaguchi, Yutaro Tight approximation for unconstrained XOS maximization. (English) Zbl 1484.90092 Math. Oper. Res. 46, No. 4, 1599-1610 (2021). MSC: 90C27 68W25 68Q25 PDFBibTeX XMLCite \textit{Y. Filmus} et al., Math. Oper. Res. 46, No. 4, 1599--1610 (2021; Zbl 1484.90092) Full Text: DOI arXiv
Tan, Jingjing; Chen, Wenting; Li, Meixia; Wang, Wenchao Randomized parallel algorithm for maximizing nonsubmodular function subject to cardinality constraint. (English) Zbl 07467522 Asia-Pac. J. Oper. Res. 38, No. 5, Article ID 2140009, 11 p. (2021). MSC: 90C27 68W15 68W20 PDFBibTeX XMLCite \textit{J. Tan} et al., Asia-Pac. J. Oper. Res. 38, No. 5, Article ID 2140009, 11 p. (2021; Zbl 07467522) Full Text: DOI
Zhang, Zhenning; Guo, Longkun; Wang, Yishui; Xu, Dachuan; Zhang, Dongmei Streaming algorithms for maximizing monotone DR-submodular functions with a cardinality constraint on the integer lattice. (English) Zbl 1481.90218 Asia-Pac. J. Oper. Res. 38, No. 5, Article ID 2140004, 14 p. (2021). MSC: 90B80 PDFBibTeX XMLCite \textit{Z. Zhang} et al., Asia-Pac. J. Oper. Res. 38, No. 5, Article ID 2140004, 14 p. (2021; Zbl 1481.90218) Full Text: DOI
Wang, Yijing; Du, Donglei; Jiang, Yanjun; Zhang, Xianzhao Non-submodular maximization with matroid and knapsack constraints. (English) Zbl 1484.90120 Asia-Pac. J. Oper. Res. 38, No. 5, Article ID 2140001, 22 p. (2021). MSC: 90C31 90C59 PDFBibTeX XMLCite \textit{Y. Wang} et al., Asia-Pac. J. Oper. Res. 38, No. 5, Article ID 2140001, 22 p. (2021; Zbl 1484.90120) Full Text: DOI
Shi, Ganquan; Gu, Shuyang; Wu, Weili \(k\)-submodular maximization with two kinds of constraints. (English) Zbl 1475.90086 Discrete Math. Algorithms Appl. 13, No. 4, Article ID 2150036, 15 p. (2021). MSC: 90C27 PDFBibTeX XMLCite \textit{G. Shi} et al., Discrete Math. Algorithms Appl. 13, No. 4, Article ID 2150036, 15 p. (2021; Zbl 1475.90086) Full Text: DOI
Cellinese, Francesco; D’Angelo, Gianlorenzo; Monaco, Gianpiero; Velaj, Yllka Generalized budgeted submodular set function maximization. (English) Zbl 1512.90192 Inf. Comput. 281, Article ID 104741, 13 p. (2021). MSC: 90C27 68W25 90C59 PDFBibTeX XMLCite \textit{F. Cellinese} et al., Inf. Comput. 281, Article ID 104741, 13 p. (2021; Zbl 1512.90192) Full Text: DOI Link
Kyrillidis, Anastasios; Shrivastava, Anshumali; Vardi, Moshe Y.; Zhang, Zhiwei Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions. (English) Zbl 1520.68105 Artif. Intell. 299, Article ID 103559, 32 p. (2021). MSC: 68R07 06E30 68T20 PDFBibTeX XMLCite \textit{A. Kyrillidis} et al., Artif. Intell. 299, Article ID 103559, 32 p. (2021; Zbl 1520.68105) Full Text: DOI
Sun, Xin; Xu, Dachuan; Guo, Longkun; Li, Min Deterministic approximation algorithm for submodular maximization subject to a matroid constraint. (English) Zbl 1496.68380 Theor. Comput. Sci. 890, 1-15 (2021). Reviewer: Vladimír Lacko (Košice) MSC: 68W25 05B35 90C27 90C59 PDFBibTeX XMLCite \textit{X. Sun} et al., Theor. Comput. Sci. 890, 1--15 (2021; Zbl 1496.68380) Full Text: DOI
Zhang, Zhenning; Du, Donglei; Jiang, Yanjun; Wu, Chenchen Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint. (English) Zbl 1479.90182 J. Glob. Optim. 80, No. 3, 595-616 (2021). Reviewer: Svetlana A. Kravchenko (Minsk) MSC: 90C27 68W25 68W40 90C25 90C05 05B35 PDFBibTeX XMLCite \textit{Z. Zhang} et al., J. Glob. Optim. 80, No. 3, 595--616 (2021; Zbl 1479.90182) Full Text: DOI
van Bevern, René; Tsidulko, Oxana Yu.; Zschoche, Philipp Representative families for matroid intersections, with applications to location, packing, and covering problems. (English) Zbl 1469.90125 Discrete Appl. Math. 298, 110-128 (2021). MSC: 90C27 PDFBibTeX XMLCite \textit{R. van Bevern} et al., Discrete Appl. Math. 298, 110--128 (2021; Zbl 1469.90125) Full Text: DOI arXiv
Shi, Majun; Yang, Zishen; Kim, Donghyun; Wang, Wei Non-monotone submodular function maximization under \(k\)-system constraint. (English) Zbl 1468.90115 J. Comb. Optim. 41, No. 1, 128-142 (2021). MSC: 90C27 PDFBibTeX XMLCite \textit{M. Shi} et al., J. Comb. Optim. 41, No. 1, 128--142 (2021; Zbl 1468.90115) Full Text: DOI
Yang, Ruiqi; Xu, Dachuan; Guo, Longkun; Zhang, Dongmei Sequence submodular maximization meets streaming. (English) Zbl 1468.90139 J. Comb. Optim. 41, No. 1, 43-55 (2021). MSC: 90C35 PDFBibTeX XMLCite \textit{R. Yang} et al., J. Comb. Optim. 41, No. 1, 43--55 (2021; Zbl 1468.90139) Full Text: DOI
Huang, Chien-Chung; Kakimura, Naonori Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint. (English) Zbl 1522.68761 Algorithmica 83, No. 3, 879-902 (2021). MSC: 68W27 68W25 90C27 PDFBibTeX XMLCite \textit{C.-C. Huang} and \textit{N. Kakimura}, Algorithmica 83, No. 3, 879--902 (2021; Zbl 1522.68761) Full Text: DOI
Feldman, Moran Guess free maximization of submodular and linear sums. (English) Zbl 1512.68449 Algorithmica 83, No. 3, 853-878 (2021); correction ibid. 84, No. 10, 3101-3102 (2022). MSC: 68W25 68Q25 90C27 PDFBibTeX XMLCite \textit{M. Feldman}, Algorithmica 83, No. 3, 853--878 (2021; Zbl 1512.68449) Full Text: DOI arXiv
Zhang, Hongxiang; Xu, Dachuan; Guo, Longkun; Tan, Jingjing Parallelized maximization of nonsubmodular function subject to a cardinality constraint. (English) Zbl 1501.90087 Theor. Comput. Sci. 864, 129-137 (2021). MSC: 90C27 68W25 90C59 PDFBibTeX XMLCite \textit{H. Zhang} et al., Theor. Comput. Sci. 864, 129--137 (2021; Zbl 1501.90087) Full Text: DOI
Feldman, Moran; Svensson, Ola; Zenklusen, Rico Online contention resolution schemes with applications to Bayesian selection problems. (English) Zbl 1509.68339 SIAM J. Comput. 50, No. 2, 255-300 (2021). MSC: 68W27 68R05 91B24 PDFBibTeX XMLCite \textit{M. Feldman} et al., SIAM J. Comput. 50, No. 2, 255--300 (2021; Zbl 1509.68339) Full Text: DOI
Liu, Yanchao A note on solving DiDi’s driver-order matching problem. (English) Zbl 1460.90154 Optim. Lett. 15, No. 1, 109-125 (2021). MSC: 90C27 90C11 90B06 PDFBibTeX XMLCite \textit{Y. Liu}, Optim. Lett. 15, No. 1, 109--125 (2021; Zbl 1460.90154) Full Text: DOI
Fairstein, Yaron; Kulik, Ariel; Naor, Joseph (Seffi); Raz, Danny; Shachnai, Hadas A \((1-e^{-1}-\varepsilon)\)-approximation for the monotone submodular multiple knapsack problem. (English) Zbl 07651183 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 44, 19 p. (2020). MSC: 68Wxx PDFBibTeX XMLCite \textit{Y. Fairstein} et al., LIPIcs -- Leibniz Int. Proc. Inform. 173, Article 44, 19 p. (2020; Zbl 07651183) Full Text: DOI
Barman, Siddharth; Fawzi, Omar; Ghoshal, Suprovat; Gürpınar, Emirhan Tight approximation bounds for maximum multi-coverage. (English) Zbl 1503.90104 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 PDFBibTeX XMLCite \textit{S. Barman} et al., Lect. Notes Comput. Sci. 12125, 66--77 (2020; Zbl 1503.90104) Full Text: DOI
Tang, Shaojie; Yuan, Jing Adaptive robust submodular optimization and beyond. (English) Zbl 1485.90086 Zhang, Zhao (ed.) et al., Algorithmic aspects in information and management. 14th international conference, AAIM 2020, Jinhua, China, August 10–12, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12290, 185-194 (2020). MSC: 90C17 90C27 PDFBibTeX XMLCite \textit{S. Tang} and \textit{J. Yuan}, Lect. Notes Comput. Sci. 12290, 185--194 (2020; Zbl 1485.90086) Full Text: DOI
Zhang, Hongxiang; Xu, Dachuan; Guo, Longkun; Tan, Jingjing Parallelized maximization of nonsubmodular function subject to a cardinality constraint. (English) Zbl 07336131 Kim, Donghyun (ed.) et al., Computing and combinatorics. 26th international conference, COCOON 2020, Atlanta, GA, USA, August 29–31, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12273, 520-531 (2020). MSC: 68Rxx PDFBibTeX XMLCite \textit{H. Zhang} et al., Lect. Notes Comput. Sci. 12273, 520--531 (2020; Zbl 07336131) Full Text: DOI
Hassani, Hamed; Karbasi, Amin; Mokhtari, Aryan; Shen, Zebang Stochastic conditional gradient++: (Non)convex minimization and continuous submodular maximization. (English) Zbl 1456.49023 SIAM J. Optim. 30, No. 4, 3315-3344 (2020). MSC: 49M05 49M15 49M37 90C06 90C30 PDFBibTeX XMLCite \textit{H. Hassani} et al., SIAM J. Optim. 30, No. 4, 3315--3344 (2020; Zbl 1456.49023) Full Text: DOI
Singh, Mohit; Xie, Weijun Approximation algorithms for \(D\)-optimal design. (English) Zbl 1456.62158 Math. Oper. Res. 45, No. 4, 1512-1534 (2020). MSC: 62K05 90C27 68W25 PDFBibTeX XMLCite \textit{M. Singh} and \textit{W. Xie}, Math. Oper. Res. 45, No. 4, 1512--1534 (2020; Zbl 1456.62158) Full Text: DOI arXiv
Han, Kai; He, Yuntian; Liu, Alex X.; Tang, Shaojie; Huang, He Differentially private and budget-limited bandit learning over matroids. (English) Zbl 1474.68253 INFORMS J. Comput. 32, No. 3, 790-804 (2020). MSC: 68T05 05B35 62L10 62L15 68P27 90C27 PDFBibTeX XMLCite \textit{K. Han} et al., INFORMS J. Comput. 32, No. 3, 790--804 (2020; Zbl 1474.68253) Full Text: DOI
Niazadeh, Rad; Roughgarden, Tim; Wang, Joshua R. Optimal algorithms for continuous non-monotone submodular and DR-submodular maximization. (English) Zbl 1520.65047 J. Mach. Learn. Res. 21, Paper No. 125, 31 p. (2020). MSC: 65K10 68T05 PDFBibTeX XMLCite \textit{R. Niazadeh} et al., J. Mach. Learn. Res. 21, Paper No. 125, 31 p. (2020; Zbl 1520.65047) Full Text: arXiv Link
Mokhtari, Aryan; Hassani, Hamed; Karbasi, Amin Stochastic conditional gradient methods: from convex minimization to submodular maximization. (English) Zbl 1507.68249 J. Mach. Learn. Res. 21, Paper No. 105, 49 p. (2020). MSC: 68T05 68W25 90C15 90C25 PDFBibTeX XMLCite \textit{A. Mokhtari} et al., J. Mach. Learn. Res. 21, Paper No. 105, 49 p. (2020; Zbl 1507.68249) Full Text: arXiv Link
Liu, Yajing; Chong, Edwin K. P.; Pezeshki, Ali; Zhang, Zhenliang Submodular optimization problems and greedy strategies: a survey. (English) Zbl 1453.90134 Discrete Event Dyn. Syst. 30, No. 3, 381-412 (2020). MSC: 90C27 PDFBibTeX XMLCite \textit{Y. Liu} et al., Discrete Event Dyn. Syst. 30, No. 3, 381--412 (2020; Zbl 1453.90134) Full Text: DOI arXiv
Buchbinder, Niv; Feldman, Moran; Filmus, Yuval; Garg, Mohit Online submodular maximization: beating 1/2 made simple. (English) Zbl 1453.68215 Math. Program. 183, No. 1-2 (B), 149-169 (2020). MSC: 68W27 90C27 90C30 91B26 PDFBibTeX XMLCite \textit{N. Buchbinder} et al., Math. Program. 183, No. 1--2 (B), 149--169 (2020; Zbl 1453.68215) Full Text: DOI arXiv
Huang, Chien-Chung; Kakimura, Naonori; Yoshida, Yuichi Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint. (English) Zbl 1435.68389 Algorithmica 82, No. 4, 1006-1032 (2020). MSC: 68W27 68W25 90C27 PDFBibTeX XMLCite \textit{C.-C. Huang} et al., Algorithmica 82, No. 4, 1006--1032 (2020; Zbl 1435.68389) Full Text: DOI Link
Gu, Shuyang; Shi, Ganquan; Wu, Weili; Lu, Changhong A fast double greedy algorithm for non-monotone DR-submodular function maximization. (English) Zbl 1436.90123 Discrete Math. Algorithms Appl. 12, No. 1, Article ID 2050007, 11 p. (2020). Reviewer: Hang Lau (Montréal) MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{S. Gu} et al., Discrete Math. Algorithms Appl. 12, No. 1, Article ID 2050007, 11 p. (2020; Zbl 1436.90123) Full Text: DOI
Tang, Shaojie Price of dependence: stochastic submodular maximization with dependent items. (English) Zbl 1437.90117 J. Comb. Optim. 39, No. 2, 305-314 (2020). MSC: 90C15 68W20 68W25 PDFBibTeX XMLCite \textit{S. Tang}, J. Comb. Optim. 39, No. 2, 305--314 (2020; Zbl 1437.90117) Full Text: DOI arXiv
Huang, Lingxiao; Li, Jian; Shi, Qicai Approximation algorithms for the connected sensor cover problem. (English) Zbl 1436.68383 Theor. Comput. Sci. 809, 563-574 (2020). MSC: 68U05 68M18 68W25 PDFBibTeX XMLCite \textit{L. Huang} et al., Theor. Comput. Sci. 809, 563--574 (2020; Zbl 1436.68383) Full Text: DOI arXiv
Bradac, Domagoj; Singla, Sahil; Zuzic, Goran (Near) optimal adaptivity gaps for stochastic multi-value probing. (English) Zbl 07650116 Achlioptas, Dimitris (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques, 22nd international conference, APPROX 2019, and 23rd international conference, RANDOM 2019, Massachusetts Institute of Technology, Cambridge, MA, USA, September 20–22, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 145, Article 49, 21 p. (2019). MSC: 68W20 68W25 90C27 PDFBibTeX XMLCite \textit{D. Bradac} et al., LIPIcs -- Leibniz Int. Proc. Inform. 145, Article 49, 21 p. (2019; Zbl 07650116) Full Text: DOI arXiv
Huang, Chien-Chung; Mari, Mathieu; Mathieu, Claire; Mitchell, Joseph S. B.; Mustafa, Nabil H. Maximizing covered area in the Euclidean plane with connectivity constraint. (English) Zbl 07650099 Achlioptas, Dimitris (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques, 22nd international conference, APPROX 2019, and 23rd international conference, RANDOM 2019, Massachusetts Institute of Technology, Cambridge, MA, USA, September 20–22, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 145, Article 32, 21 p. (2019). MSC: 68W20 68W25 90C27 PDFBibTeX XMLCite \textit{C.-C. Huang} et al., LIPIcs -- Leibniz Int. Proc. Inform. 145, Article 32, 21 p. (2019; Zbl 07650099) Full Text: DOI
Moseley, Benjamin; Sviridenko, Maxim Submodular optimization with contention resolution extensions. (English) Zbl 07650070 Achlioptas, Dimitris (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques, 22nd international conference, APPROX 2019, and 23rd international conference, RANDOM 2019, Massachusetts Institute of Technology, Cambridge, MA, USA, September 20–22, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 145, Article 3, 17 p. (2019). MSC: 68W20 68W25 90C27 PDFBibTeX XMLCite \textit{B. Moseley} and \textit{M. Sviridenko}, LIPIcs -- Leibniz Int. Proc. Inform. 145, Article 3, 17 p. (2019; Zbl 07650070) Full Text: DOI
Ene, Alina; Nguyen, Huy L. Towards nearly-linear time algorithms for submodular maximization with a matroid constraint. (English) Zbl 07561547 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 54, 14 p. (2019). MSC: 68Nxx 68Qxx PDFBibTeX XMLCite \textit{A. Ene} and \textit{H. L. Nguyen}, LIPIcs -- Leibniz Int. Proc. Inform. 132, Article 54, 14 p. (2019; Zbl 07561547) Full Text: DOI arXiv
Cohen-Addad, Vincent; Gupta, Anupam; Kumar, Amit; Lee, Euiwoong; Li, Jason Tight FPT approximations for \(k\)-median and \(k\)-means. (English) Zbl 07561535 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 42, 14 p. (2019). MSC: 68Nxx 68Qxx PDFBibTeX XMLCite \textit{V. Cohen-Addad} et al., LIPIcs -- Leibniz Int. Proc. Inform. 132, Article 42, 14 p. (2019; Zbl 07561535) Full Text: DOI arXiv
Kulik, Ariel; Sarpatwar, Kanthi; Schieber, Baruch; Shachnai, Hadas Generalized assignment via submodular optimization with reserved capacity. (English) Zbl 07525506 Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 69, 15 p. (2019). MSC: 68Wxx PDFBibTeX XMLCite \textit{A. Kulik} et al., LIPIcs -- Leibniz Int. Proc. Inform. 144, Article 69, 15 p. (2019; Zbl 07525506) Full Text: DOI arXiv
Bruggmann, Simon; Zenklusen, Rico Submodular maximization through the lens of linear programming. (English) Zbl 1437.90096 Math. Oper. Res. 44, No. 4, 1221-1244 (2019). MSC: 90C05 90C27 68W25 68W40 90C60 PDFBibTeX XMLCite \textit{S. Bruggmann} and \textit{R. Zenklusen}, Math. Oper. Res. 44, No. 4, 1221--1244 (2019; Zbl 1437.90096) Full Text: DOI arXiv
Buchbinder, Niv; Feldman, Moran Constrained submodular maximization via a nonsymmetric technique. (English) Zbl 1434.68674 Math. Oper. Res. 44, No. 3, 988-1005 (2019). MSC: 68W25 90C27 90C35 90C59 PDFBibTeX XMLCite \textit{N. Buchbinder} and \textit{M. Feldman}, Math. Oper. Res. 44, No. 3, 988--1005 (2019; Zbl 1434.68674) Full Text: DOI arXiv
Sarpatwar, Kanthi K.; Schieber, Baruch; Shachnai, Hadas Constrained submodular maximization via greedy local search. (English) Zbl 1476.90289 Oper. Res. Lett. 47, No. 1, 1-6 (2019). MSC: 90C27 PDFBibTeX XMLCite \textit{K. K. Sarpatwar} et al., Oper. Res. Lett. 47, No. 1, 1--6 (2019; Zbl 1476.90289) Full Text: DOI arXiv
Lai, Lei; Ni, Qiufen; Lu, Changhong; Huang, Chuanhe; Wu, Weili Monotone submodular maximization over the bounded integer lattice with cardinality constraints. (English) Zbl 1427.90243 Discrete Math. Algorithms Appl. 11, No. 6, Article ID 1950075, 14 p. (2019). MSC: 90C27 PDFBibTeX XMLCite \textit{L. Lai} et al., Discrete Math. Algorithms Appl. 11, No. 6, Article ID 1950075, 14 p. (2019; Zbl 1427.90243) Full Text: DOI
Buchbinder, Niv; Feldman, Moran; Schwartz, Roy Online submodular maximization with preemption. (English) Zbl 1453.68216 ACM Trans. Algorithms 15, No. 3, Article No. 30, 31 p. (2019). MSC: 68W27 90C27 PDFBibTeX XMLCite \textit{N. Buchbinder} et al., ACM Trans. Algorithms 15, No. 3, Article No. 30, 31 p. (2019; Zbl 1453.68216) Full Text: DOI arXiv