Distributed Submodular Maximization with Parallel Execution

30 Jun 2020 Sun Haoyuan Grimsman David Marden Jason R

The submodular maximization problem is widely applicable in many engineering problems where objectives exhibit diminishing returns. While this problem is known to be NP-hard for certain subclasses of objective functions, there is a greedy algorithm which guarantees approximation at least 1/2 of the optimal solution... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • DISTRIBUTED, PARALLEL, AND CLUSTER COMPUTING
  • MULTIAGENT SYSTEMS
  • SYSTEMS AND CONTROL
  • SYSTEMS AND CONTROL