Cover Image

Improved Algorithms for Maximum Coverage in Dynamic and Random Order Streams

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chakrabarti, Amit, McGregor, Andrew, Wirth, Anthony
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Streaming Algorithms for Bin Packing and Vector Scheduling
by: Cormode, Graham, et al.
Published: (2019)

A sufficient condition for characterizing the one-sided testable properties of families of graphs in the Random Neighbour Oracle Model
by: Awofeso, Christine, et al.
Published: (2025)

Approximate Minimum Sum Colorings and Maximum $k$-Colorable Subgraphs of Chordal Graphs
by: DeHaan, Ian, et al.
Published: (2024)

Approximating Maximum Cut on Interval Graphs and Split Graphs beyond Goemans-Williamson
by: Ahn, Jungho, et al.
Published: (2025)

Fast Order Statistics with Group Inequality Testing
by: Liyanage, Adiesha, et al.
Published: (2025)

An Algorithmic Bridge Between Hamming and Levenshtein Distances
by: Goldenberg, Elazar, et al.
Published: (2022)

New Sorting Algorithm Wave Sort (W-Sort)
by: Wei, Jia Xu
Published: (2025)

A Faster Directed Single-Source Shortest Path Algorithm
by: Duan, Ran, et al.
Published: (2026)

Faster Algorithms for Global Minimum Vertex-Cut in Directed Graphs
by: Chuzhoy, Julia, et al.
Published: (2025)

Improving Online Bin Covering with Little Advice
by: Brodnik, Andrej, et al.
Published: (2025)

Almost-Optimal Approximation Algorithms for Global Minimum Cut in Directed Graphs
by: Mosenzon, Ron
Published: (2025)

On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized Sorting
by: Goswami, Mayank, et al.
Published: (2022)

Bidirectional Dijkstra's Algorithm is Instance-Optimal
by: Haeupler, Bernhard, et al.
Published: (2024)

Near-Linear Time Computation of Welzl Orders on Graphs with Linear Neighborhood Complexity
by: Dreier, Jan, et al.
Published: (2026)

Approximation Algorithms for Action-Reward Query-Commit Matching
by: Derakhshan, Mahsa, et al.
Published: (2026)

Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs
by: Balzotti, Lorenzo
Published: (2020)

Guarding Offices with Maximum Dispersion
by: Fekete, Sándor P., et al.
Published: (2025)

Minimum Riesz s-Energy Subset Selection in Ordered Point Sets via Dynamic Programming
by: Emmerich, Michael
Published: (2025)

Online Maximum Independent Set of Hyperrectangles
by: Advani, Rishi, et al.
Published: (2023)

Multiplication of 0-1 matrices via clustering
by: Jansson, Jesper, et al.
Published: (2025)

Fast approximate $\ell$-center clustering in high dimensional spaces
by: Kowaluk, Mirosław, et al.
Published: (2025)

Maximum Polygon Packing: The CG:SHOP Challenge 2024
by: Fekete, Sándor P., et al.
Published: (2024)

Deterministic Minimum Steiner Cut in Maximum Flow Time
by: Ding, Matthew, et al.
Published: (2023)

Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions
by: Grandoni, Fabrizio, et al.
Published: (2024)

Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM
by: Randolph, Tim, et al.
Published: (2024)

Online $b$-Matching with Stochastic Rewards
by: Albers, Susanne, et al.
Published: (2024)

Scheduling with Obligatory Tests
by: Dogeas, Konstantinos, et al.
Published: (2024)

Revisiting Path Contraction and Cycle Contraction
by: Krithika, R., et al.
Published: (2024)

A faster algorithm for the construction of optimal factoring automata
by: Erlebach, Thomas, et al.
Published: (2024)

Online Combinatorial Optimization with Graphical Dependencies
by: Gao, Zhimeng, et al.
Published: (2025)

Offline green bin packing and its constrained variant
by: Gong, Mingyang, et al.
Published: (2026)

Exploiting Low Scanwidth to Resolve Soft Polytomies
by: Bruchhold, Sebastian, et al.
Published: (2025)

Online computation of normalized substring complexity
by: Kucherov, Gregory, et al.
Published: (2025)

Approximation algorithms for scheduling with rejection in green manufacturing
by: Gong, Mingyang, et al.
Published: (2025)

The cost of cyclic permutations and remainder sums in the Euclidean algorithm
by: Blomer, Valentin, et al.
Published: (2026)

Polytope Scheduling with Groups: Unified Models and Optimal Guarantees
by: Lindermayr, Alexander, et al.
Published: (2025)

Connected Components in Linear Work and Near-Optimal Time
by: Farhadi, Alireza, et al.
Published: (2023)

Hierarchical Exponential Search Via K-Spines
by: Dong, Bob
Published: (2025)

On the satisfability of random k-Horn formulae
by: Istrate, Gabriel
Published: (2000)

Search and evacuation with a near majority of faulty agents
by: Czyzowicz, J., et al.
Published: (2026)