IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v45y2023i2d10.1007_s10878-023-00986-y.html
   My bibliography  Save this article

On streaming algorithms for maximizing a supermodular function plus a MDR-submodular function on the integer lattice

Author

Listed:
  • Jingjing Tan

    (Weifang University)

  • Yicheng Xu

    (Chinese Academy of Sciences
    Guangxi Key Laboratory of Cryptography and Information Security)

  • Dongmei Zhang

    (Shandong Jianzhu University)

  • Xiaoqing Zhang

    (Beijing University of Technology)

Abstract

In this paper, we provide a streaming algorithm for the problem of maximizing the sum of a supermodular function and a nonnegative monotone diminishing return submodular (MDR-submodular) function with a knapsack constraint on the integer lattice. Inspired by the SIEVE-STREAMING algorithm, we present a two-pass streaming algorithm by using the threshold technique. Then, we improve the two-pass streaming algorithm to one-pass and further reduce its space complexity. The proposed algorithms are proved to have polynomial time and space complexity, and a performance guarantee dependent on the curvature of the supermodular function. Finally, we carry out numerical experiments to verify the performance of the algorithm.

Suggested Citation

  • Jingjing Tan & Yicheng Xu & Dongmei Zhang & Xiaoqing Zhang, 2023. "On streaming algorithms for maximizing a supermodular function plus a MDR-submodular function on the integer lattice," Journal of Combinatorial Optimization, Springer, vol. 45(2), pages 1-19, March.
    • Handle: RePEc:spr:jcomop:v:45:y:2023:i:2:d:10.1007_s10878-023-00986-y
    DOI: 10.1007/s10878-023-00986-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-023-00986-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-023-00986-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Simai He & Jiawei Zhang & Shuzhong Zhang, 2012. "Polymatroid Optimization, Submodularity, and Joint Replenishment Games," Operations Research, INFORMS, vol. 60(1), pages 128-137, February.
    2. Ruiqi Yang & Dachuan Xu & Min Li & Yicheng Xu, 2019. "Thresholding Methods for Streaming Submodular Maximization with a Cardinality Constraint and Its Variants," Springer Optimization and Its Applications, in: Ding-Zhu Du & Panos M. Pardalos & Zhao Zhang (ed.), Nonlinear Combinatorial Optimization, pages 123-140, Springer.
    3. Yijing Wang & Dachuan Xu & Yishui Wang & Dongmei Zhang, 2020. "Non-submodular maximization on massive data streams," Journal of Global Optimization, Springer, vol. 76(4), pages 729-743, April.
    4. Zhenning Zhang & Donglei Du & Yanjun Jiang & Chenchen Wu, 2021. "Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint," Journal of Global Optimization, Springer, vol. 80(3), pages 595-616, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Simai He & Jay Sethuraman & Xuan Wang & Jiawei Zhang, 2017. "A NonCooperative Approach to Cost Allocation in Joint Replenishment," Operations Research, INFORMS, vol. 65(6), pages 1562-1573, December.
    2. Majun Shi & Zishen Yang & Wei Wang, 2023. "Greedy Guarantees for Non-submodular Function Maximization Under Independent System Constraint with Applications," Journal of Optimization Theory and Applications, Springer, vol. 196(2), pages 516-543, February.
    3. Martijn H. H. Schoot Uiterkamp & Marco E. T. Gerards & Johann L. Hurink, 2022. "On a Reduction for a Class of Resource Allocation Problems," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1387-1402, May.
    4. Nguyen, Christine & Dessouky, Maged & Toriello, Alejandro, 2014. "Consolidation strategies for the delivery of perishable products," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 69(C), pages 108-121.
    5. Yijing Wang & Dachuan Xu & Donglei Du & Yanjun Jiang, 2022. "Bicriteria streaming algorithms to balance gain and cost with cardinality constraint," Journal of Combinatorial Optimization, Springer, vol. 44(4), pages 2946-2962, November.
    6. Lindong Liu & Xiangtong Qi & Zhou Xu, 2016. "Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 687-702, November.
    7. Ruiqi Yang & Dachuan Xu & Longkun Guo & Dongmei Zhang, 2021. "Sequence submodular maximization meets streaming," Journal of Combinatorial Optimization, Springer, vol. 41(1), pages 43-55, January.
    8. Bin Liu & Zihan Chen & Huijuan Wang & Weili Wu, 2023. "An optimal streaming algorithm for non-submodular functions maximization on the integer lattice," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-17, January.
    9. Luo, Chunlin & Zhou, Xiaoyang & Lev, Benjamin, 2022. "Core, shapley value, nucleolus and nash bargaining solution: A Survey of recent developments and applications in operations management," Omega, Elsevier, vol. 110(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:45:y:2023:i:2:d:10.1007_s10878-023-00986-y. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.