Parallelizing Greedy for Submodular Set Function Maximization in Matroids and Beyond

被引:25
|
作者
Chekuri, Chandra [1 ]
Quanrud, Kent [1 ]
机构
[1] Univ Illinois, Urbana, IL 61801 USA
关键词
submodular maximization; parallel algorithms; matroids; COMPLEXITY; MATRIX; RANK;
D O I
10.1145/3313276.3316406
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We consider parallel, or low adaptivity, algorithms for submodular function maximization. This line of work was recently initiated by Balkanski and Singer and has already led to several interesting results on the cardinality constraint and explicit packing constraints. An important open problem is the classical setting of matroid constraint, which has been instrumental for developments in submodular function maximization. In this paper we develop a general strategy to parallelize the well-studied greedy algorithm and use it to obtain a randomized (1/2 - epsilon)-approximation in O(log(2)(n)/epsilon(2)) rounds of adaptivity. We rely on this algorithm, and an elegant amplification approach due to Badanidiyuru and Vondrak to obtain a fractional solution that yields a near-optimal randomized (1 - 1/e - epsilon)-approximation in O(log(2)(n)/epsilon(3)) rounds of adaptivity. For non-negative functions we obtain a (3 - 2 root 2 - epsilon) - approximation and a fractional solution that yields a (1/e - epsilon)approximation. Our approach for parallelizing greedy yields approximations for intersections of matroids and matchoids, and the approximation ratios are comparable to those known for sequential greedy.
引用
收藏
页码:78 / 89
页数:12
相关论文
共 50 条
  • [1] UNIFIED GREEDY APPROXIMABILITY BEYOND SUBMODULAR MAXIMIZATION
    Disser, Yann
    Weckbecker, David
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2024, 38 (01) : 348 - 379
  • [2] Unified Greedy Approximability Beyond Submodular Maximization
    Disser, Yann
    Weckbecker, David
    [J]. COMBINATORIAL OPTIMIZATION (ISCO 2022), 2022, 13526 : 299 - 311
  • [3] New performance guarantees for the greedy maximization of submodular set functions
    Laitila, Jussi
    Moilanen, Atte
    [J]. OPTIMIZATION LETTERS, 2017, 11 (04) : 655 - 665
  • [4] New performance guarantees for the greedy maximization of submodular set functions
    Jussi Laitila
    Atte Moilanen
    [J]. Optimization Letters, 2017, 11 : 655 - 665
  • [5] Generalized budgeted submodular set function maximization
    Cellinese, Francesco
    D'Angelo, Gianlorenzo
    Monaco, Gianpiero
    Velaj, Yllka
    [J]. INFORMATION AND COMPUTATION, 2021, 281
  • [6] Impact of Information in Greedy Submodular Maximization
    Grimsman, David
    Ali, Mohd. Shabbir
    Hespanha, Joao P.
    Marden, Jason R.
    [J]. 2017 IEEE 56TH ANNUAL CONFERENCE ON DECISION AND CONTROL (CDC), 2017,
  • [7] Parallel Double Greedy Submodular Maximization
    Pan, Xinghao
    Jegelka, Stefanie
    Gonzalez, Joseph
    Bradley, Joseph
    Jordan, Michael, I
    [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 27 (NIPS 2014), 2014, 27
  • [8] Deletion Robust Submodular Maximization over Matroids
    Dutting, Paul
    Fusco, Federico
    Lattanzi, Silvio
    Norouzi-Fard, Ashkan
    Zadimoghaddam, Morteza
    [J]. INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 162, 2022,
  • [9] Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy?
    Chen, Lin
    Feldman, Moran
    Karbasi, Amin
    [J]. INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 80, 2018, 80
  • [10] Faster Submodular Maximization for Several Classes of Matroids
    Henzinger, Monika
    Liu, Paul
    Vondrák, Jan
    Zheng, Da Wei
    [J]. Leibniz International Proceedings in Informatics, LIPIcs, 2023, 261