ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1801.02793
  4. Cited By
Tight Bounds on the Round Complexity of the Distributed Maximum Coverage
  Problem
v1v2 (latest)

Tight Bounds on the Round Complexity of the Distributed Maximum Coverage Problem

9 January 2018
Sepehr Assadi
S. Khanna
ArXiv (abs)PDFHTML

Papers citing "Tight Bounds on the Round Complexity of the Distributed Maximum Coverage Problem"

2 / 2 papers shown
Title
Equivalence Classes and Conditional Hardness in Massively Parallel
  Computations
Equivalence Classes and Conditional Hardness in Massively Parallel Computations
Danupon Nanongkai
Michele Scquizzato
61
18
0
07 Jan 2020
Submodular Optimization in the MapReduce Model
Submodular Optimization in the MapReduce Model
Paul Liu
J. Vondrák
54
30
0
02 Oct 2018
1