Improved Algorithms for Maximum Coverage in Dynamic and Random Order Streams

被引：0
|
作者：
Chakrabarti, Amit [1 ]
McGregor, Andrew [2 ]
Wirth, Anthony [3 ,4 ]
机构：
[1] Department of Computer Science, Dartmouth College, Hanover,NH, United States
[2] Manning College of Information and Computer Sciences, University of Massachusetts, Amherst,MA, United States
[3] School of Computing and Information Systems, The University of Melbourne, Australia
[4] School of Computer Science, The University of Sydney, Australia
来源：
Leibniz International Proceedings in Informatics, LIPIcs | / 308卷
关键词：
Compendex;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Approximation algorithms
引用
收藏
相关论文
共 50 条
  • [41] Improved algorithms for the K-maximum subarray problem
    Bae, Sung Eun
    Takaoka, Tadao
    Computer Journal, 2006, 49 (03): : 358 - 374
  • [42] Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs
    Zhou, Peiyan
    Jiang, Haitao
    Zhu, Daming
    Zhu, Binhai
    Theoretical Computer Science, 2021, 888 : 22 - 30
  • [43] Approximation algorithms for maximum coverage and max cut with given sizes of parts
    Ageev, AA
    Sviridenko, MI
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 1999, 1610 : 17 - 30
  • [44] Improved algorithms for the k maximum-sums problems
    Cheng, CH
    Chen, KY
    Tien, WC
    Chao, KM
    ALGORITHMS AND COMPUTATION, 2005, 3827 : 799 - 808
  • [45] Research on Optimization Algorithms of k-Maximum Coverage Skyline Queries
    Bai M.
    Wang X.-T.
    Li G.-Y.
    Ning B.
    Zhou X.
    Jisuanji Xuebao/Chinese Journal of Computers, 2020, 43 (12): : 2276 - 2297
  • [46] Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage of a Linear Domain
    Danny Z. Chen
    Yan Gu
    Jian Li
    Haitao Wang
    Discrete & Computational Geometry, 2013, 50 : 374 - 408
  • [47] Improved Algorithms for Maximum Satisfiability and Its Special Cases
    Brilliantov, Kirill
    Alferov, Vasily
    Bliznets, Ivan
    THIRTY-SEVENTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 37 NO 4, 2023, : 3898 - 3905
  • [48] Improved algorithms for the K-maximum subarray problem
    Bae, SE
    Takaoka, T
    COMPUTER JOURNAL, 2006, 49 (03): : 358 - 374
  • [49] Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs
    Zhou, Peiyan
    Jiang, Haitao
    Zhu, Daming
    Zhu, Binhai
    THEORETICAL COMPUTER SCIENCE, 2021, 888 : 22 - 30
  • [50] Improved approximation algorithms for maximum graph partitioning problems
    Jager, G
    Srivastav, A
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2005, 10 (02) : 133 - 167
12345