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 条
  • [1] Dynamic Maximum Entropy Algorithms for Clustering and Coverage Control
    Xu, Yunwen
    Salapaka, S.
    Beck, C. L.
    49TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC), 2010, : 1836 - 1841
  • [2] Improved Bounds for Matching in Random-Order Streams
    Bernstein, Aaron
    THEORY OF COMPUTING SYSTEMS, 2024, 68 (04) : 758 - 772
  • [3] Approximate Maximum Matching in Random Streams
    Farhadi, Alireza
    Hajiaghayi, MohammadTaghi
    Mai, Tung
    Rao, Anup
    Rossi, Ryan A.
    PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 1773 - 1785
  • [4] Approximate Maximum Matching in Random Streams
    Farhadi, Alireza
    Hajiaghayi, MohammadTaghi
    Mai, Tung
    Rao, Anup
    Rossi, Ryan A.
    PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 1773 - 1785
  • [5] Improved Online Algorithms for Knapsack and GAP in the Random Order Model
    Susanne Albers
    Arindam Khan
    Leon Ladewig
    Algorithmica, 2021, 83 : 1750 - 1785
  • [6] Improved Online Algorithms for Knapsack and GAP in the Random Order Model
    Albers, Susanne
    Khan, Arindam
    Ladewig, Leon
    ALGORITHMICA, 2021, 83 (06) : 1750 - 1785
  • [7] Better Streaming Algorithms for the Maximum Coverage Problem
    Andrew McGregor
    Hoa T. Vu
    Theory of Computing Systems, 2019, 63 : 1595 - 1619
  • [8] Better Streaming Algorithms for the Maximum Coverage Problem
    McGregor, Andrew
    Vu, Hoa T.
    THEORY OF COMPUTING SYSTEMS, 2019, 63 (07) : 1595 - 1619
  • [9] Approximation Algorithms for Maximum Coverage with Group Budget Constraints
    Guo, Longkun
    Li, Min
    Xu, Dachuan
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, COCOA 2017, PT II, 2017, 10628 : 362 - 376
  • [10] On the Maximum Movement of Random Sensors for Coverage and Interference on a Line
    Kapelko, Rafal
    ICDCN'18: PROCEEDINGS OF THE 19TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING AND NETWORKING, 2018,
12345