Submodular function optimisation has emerged as a cornerstone of contemporary algorithm design, offering a powerful framework to address a broad range of combinatorial problems characterised by the ...

This research paper was presented at the 64 th IEEE Symposium on Foundations of Computer Science (FOCS) 2023 (opens in new tab), a premier forum for the latest research in theoretical computer science ...

Abstract: Submodular functions are relevant to machine learning for at least two reasons: (1) some problems may be expressed directly as the optimization of submodular functions, and (2) the Lovász ...

Influence maximization is the problem of selecting k nodes in a social network to maximize their influence spread. The problem has been extensively studied but most works focus on the submodular ...

This paper investigates the multi-agent persistent monitoring problem via a novel distributed submodular receding horizon control approach. In order to approximate global monitoring performance, with ...

A k-submodular function is a generalization of a submodular function, where the input consists of k disjoint subsets, instead of a single subset, of the domain. Many machine learning problems, ...

This is the companion codebase of the publication: S M Ferdous, Alex Pothen, Arif Khan, Ajay Panyala, and Mahantesh Halappanavar, “A parallel approximation algorithm for submodular b-matching,” in ...

Due to a planned power outage on Friday, 1/14, between 8am-1pm PST, some services may be impacted. A line drawing of the Internet Archive headquarters building façade. An illustration of a magnifying ...

Due to a planned power outage on Friday, 1/14, between 8am-1pm PST, some services may be impacted. A line drawing of the Internet Archive headquarters building façade. An illustration of a magnifying ...