Covering Multiple Submodular Constraints

Updated 6 July 2026

Covering multiple submodular constraints is a discrete optimization problem requiring the selection of subsets that meet several monotone submodular lower-bound requirements while minimizing cost.
It utilizes advanced methodologies such as fractional relaxation, randomized rounding, and greedy repair to achieve near-optimal approximations even under dynamic and robust settings.
The framework applies to diverse use cases including facility location, image summarization, and fairness-driven selections, adapting techniques for both fixed and variable constraint regimes.

Covering multiple submodular constraints denotes a family of discrete optimization problems in which a subset must simultaneously satisfy several monotone submodular lower-bound requirements, usually at minimum cost. In a standard formulation, there is a finite ground set $N$ , a cost function $c:N\to \mathbb{R}_+$ , monotone submodular functions $f_1,\ldots,f_r$ , and requirements $b_1,\ldots,b_r$ ; the goal is to find a minimum cost subset $S\subseteq N$ such that $f_i(S)\ge b_i$ for all $i\in[r]$ . When $r=1$ , this is the well-known Submodular Set Cover problem; when $r$ is part of the input, approximation factors incur at least an $\Omega(\log r)$ dependence, whereas for fixed $c:N\to \mathbb{R}_+$ 0 one can recover guarantees close to the single-constraint case (Bajpai et al., 14 Jul 2025).

1. Core formulations

The basic multiple-constraint model is the problem called Multiple Submodular Covering Constraints (MSC): $c:N\to \mathbb{R}_+$ 1 where $c:N\to \mathbb{R}_+$ 2 (Bajpai et al., 14 Jul 2025). This formulation isolates the simultaneous satisfaction of several monotone submodular requirements and is the most direct formalization of “covering multiple submodular constraints.”

Several important variants refine this template rather than replace it. In the fully dynamic setting, there is an active family $c:N\to \mathbb{R}_+$ 3 of monotone, nonnegative submodular functions at time $c:N\to \mathbb{R}_+$ 4, and the current aggregate covering objective is

$c:N\to \mathbb{R}_+$ 5

The task is to maintain a near-optimal cover for $c:N\to \mathbb{R}_+$ 6 while keeping the recourse $c:N\to \mathbb{R}_+$ 7 small as functions are inserted or deleted (Gupta et al., 2020).

A robust constrained formulation appears in Robust-scsc and Robust-scsk. The former minimizes a worst-case submodular objective subject to multiple submodular lower-bound constraints,

$c:N\to \mathbb{R}_+$ 8

while the latter maximizes a worst-case submodular utility subject to multiple submodular upper-bound constraints,

$c:N\to \mathbb{R}_+$ 9

These forms explicitly separate “cost” and “coverage” roles across multiple submodular functions (Iyer, 2019).

A related single-objective, single-submodular-constraint pair is given by Submodular Cost Submodular Cover (SCSC),

$f_1,\ldots,f_r$ 0

and Submodular Cost Submodular Knapsack (SCSK),

$f_1,\ldots,f_r$ 1

These models are central because approximation algorithms for one can be transformed into approximation guarantees for the other (Iyer et al., 2013).

2. Approximation regimes and hardness structure

The approximation picture depends sharply on how many constraints are present and how they are represented. For MSC with arbitrary $f_1,\ldots,f_r$ 2, the approximation ratios are at least $f_1,\ldots,f_r$ 3, and this dependence is unavoidable when $f_1,\ldots,f_r$ 4 is part of the input (Bajpai et al., 14 Jul 2025). This barrier explains why the fixed- $f_1,\ldots,f_r$ 5 regime is treated separately in recent work.

In robust multi-constraint formulations, hardness is stronger than a logarithmic loss alone. For the multiple-constraint problems Robust-scsc and Robust-scsk, bicriteria lower bounds depend on curvature and covering complexity, and Robust-scsk does not admit a single-criterion approximation when $f_1,\ldots,f_r$ 6 unless $f_1,\ldots,f_r$ 7 (Iyer, 2019). For SCSC and SCSK, hardness is also curvature-sensitive: for any $f_1,\ldots,f_r$ 8, there exist submodular functions of curvature $f_1,\ldots,f_r$ 9 such that no polynomial-time algorithm can achieve a bi-criterion ratio better than

$b_1,\ldots,b_r$ 0

and the known guarantees are tight up to log-factors (Iyer et al., 2013).

The dynamic setting introduces a different form of impossibility. For fully dynamic Submodular Cover with $b_1,\ldots,b_r$ 1, there is a deterministic algorithm with $b_1,\ldots,b_r$ 2-competitiveness, and this competitive ratio is best possible even in the offline setting; the recourse bound is optimal up to the logarithmic factor (Gupta et al., 2020).

A broader precursor is Submodular-Cost Covering, where the objective is a non-decreasing submodular cost function and the feasible region is the intersection of arbitrary covering constraints, each depending on at most $b_1,\ldots,b_r$ 3 variables. In that model, a simple greedy procedure is a $b_1,\ldots,b_r$ 4-approximation algorithm, including the online setting where the same greedy rule is $b_1,\ldots,b_r$ 5-competitive (0807.0644). This earlier line concerns multiple covering constraints with submodular cost rather than multiple submodular covering functions, but it established an important approximation template for structured covering systems.

3. Algorithmic paradigms

A common algorithmic template for MSC with fixed $b_1,\ldots,b_r$ 6 has four stages: guess a small set of high-cost elements from an optimal solution; solve a fractional relaxation of the residual instance; round the fractional solution using randomized rounding plus a concentration bound; and greedily fix any still-unsatisfied constraints (Bajpai et al., 14 Jul 2025). The multilinear relaxation uses

$b_1,\ldots,b_r$ 7

where $b_1,\ldots,b_r$ 8 contains each element independently with probability $b_1,\ldots,b_r$ 9, together with constraints of the form

$S\subseteq N$ 0

The key technical device is a rounding lemma that combines greedy preprocessing with a Lipschitz reduction and Vondrák-style concentration: $S\subseteq N$ 1 for monotone submodular $S\subseteq N$ 2-Lipschitz functions under independent rounding (Bajpai et al., 14 Jul 2025).

The fully dynamic framework uses a markedly different representation. It maintains a permutation $S\subseteq N$ 3 of the ground set, interprets the solution as the prefix of elements with positive marginal contribution, and repeatedly applies local swaps and $S\subseteq N$ 4-moves until the permutation is stable. The recourse analysis is driven by a potential function inspired by Tsallis entropy,

$S\subseteq N$ 5

together with the notion of Mutual Coverage

$S\subseteq N$ 6

For 3-increasing functions, this yields the stronger $S\subseteq N$ 7 total recourse bound (Gupta et al., 2020).

For SCSC and SCSK, the main algorithmic paradigm is iterative surrogate optimization. One replaces a submodular cost by modular upper bounds $S\subseteq N$ 8, or by ellipsoidal approximations such as

$S\subseteq N$ 9

and then solves a sequence of easier subproblems. This produces algorithms such as Iterated Submodular Set Cover and Iterated Submodular Knapsack, with guarantees that improve as the cost function curvature decreases (Iyer et al., 2013).

Robust multi-constraint optimization uses a parallel surrogate philosophy. The main methods are average approximation, majorization-minimization (mmin), ellipsoidal approximation (ea), and convex relaxation through the Lovász extension. In mmin, each submodular objective $f_i(S)\ge b_i$ 0 is replaced by a modular upper bound $f_i(S)\ge b_i$ 1, and the next iterate solves

$f_i(S)\ge b_i$ 2

This converts robust submodular objectives into min-max combinatorial problems with modular costs (Iyer, 2019).

4. Fixed- $f_i(S)\ge b_i$ 3 covering and exact-feasibility special cases

The fixed-number-of-constraints regime is the clearest positive result for covering multiple submodular constraints. For any fixed integer $f_i(S)\ge b_i$ 4 and any $f_i(S)\ge b_i$ 5, there is a randomized bicriteria approximation for MSC that outputs $f_i(S)\ge b_i$ 6 such that

$f_i(S)\ge b_i$ 7

and

$f_i(S)\ge b_i$ 8

This is essentially the same cost–coverage tradeoff known for the single-constraint case (Bajpai et al., 14 Jul 2025).

For the special case where the $f_i(S)\ge b_i$ 9 are weighted coverage functions from a deletion-closed set system, the guarantee strengthens to an exact-feasibility approximation of

$i\in[r]$ 0

where $i\in[r]$ 1 is the approximation ratio for the underlying set cover instance obtained via the natural LP relaxation (Bajpai et al., 14 Jul 2025).

Setting	Guarantee	Notes
General MSC, fixed $i\in[r]$ 2	$i\in[r]$ 3, $i\in[r]$ 4	Randomized bicriteria
Weighted coverage, deletion-closed set system	$i\in[r]$ 5	Exact-feasibility approximation

These results extend directly to several application families. The paper explicitly mentions Colorful Set Cover, Facility Location with Multiple Outliers, and Sum of Radii with Multiple Outliers, and notes that for fixed $i\in[r]$ 6 the same framework yields constant-factor approximations in these settings (Bajpai et al., 14 Jul 2025). The structural point is that the number of submodular constraints, not merely their form, determines whether one can match single-constraint behavior.

5. Fairness, partition structure, and robust coverage

Fairness and balance constraints introduce another layer of multiplicity. In Submodular Cover with Partition Constraints (SCP), the ground set is partitioned into disjoint groups

$i\in[r]$ 7

and one seeks

$i\in[r]$ 8

The corresponding fairness-constrained variant SCF requires both lower and upper balance across groups: $i\in[r]$ 9 These models do not introduce multiple submodular functions; instead, they couple submodular cover with multiple partition-based resource constraints (Chen et al., 16 Jan 2026).

The main algorithmic strategy is a converting framework: first solve the dual maximization problem approximately, then use it to drive a cover algorithm. For monotone SCKP, the block-greedy subroutine greedy-knapsack-bi achieves

$r=1$ 0

with per-partition cost blow-up

$r=1$ 1

and after conversion the cover solution satisfies

$r=1$ 2

(Chen et al., 16 Jan 2026).

For fairness-constrained cover, Block-Fair-Bi achieves

$r=1$ 3

with bicriteria factor

$r=1$ 4

and after conversion this yields an SCF guarantee of

$r=1$ 5

The same work reports a query-complexity improvement from

$r=1$ 6

$r=1$ 7

for the fair-cover setting (Chen et al., 16 Jan 2026).

Robustness provides a different fairness-related perspective. In image collection summarization with multiple queries, the robust formulation

$r=1$ 8

is exactly a Robust-scsc problem with $r=1$ 9 and multiple submodular lower-bound constraints indexed by queries. The reported interpretation is that the robust formulation is much fairer across queries than averaging or union-query baselines (Iyer, 2019).

The multiple-submodular-cover viewpoint captures several concrete application domains. The fixed- $r$ 0 MSC framework is applied to Colorful Set Cover, Facility Location with Multiple Outliers, and Sum of Radii with Multiple Outliers (Bajpai et al., 14 Jul 2025). Robust constrained formulations are motivated by robust data subset selection, robust co-operative cuts, robust co-operative matchings, and image collection summarization with multiple queries (Iyer, 2019). The dynamic aggregate-cover model subsumes fully dynamic Set Cover / Hitting Set, where each arriving or departing hyperedge corresponds to a coverage indicator $r$ 1, yielding the familiar $r$ 2-competitive and $r$ 3-recourse behavior (Gupta et al., 2020).

Several adjacent topics are often conflated with covering multiple submodular constraints but are technically distinct. Packing-Covering Submodular Maximization (PCSM) maximizes a monotone submodular objective subject to linear packing and covering constraints,

$r$ 4

and extends to multiple monotone submodular objectives through approximate Pareto-set guarantees (Mizrachi et al., 2018). Likewise, bicriteria submodular maximization under cardinality, knapsack, matroid, and convex-set constraints studies a single submodular objective with controlled feasibility violation rather than the simultaneous covering of several submodular lower bounds (Feldman et al., 14 Jul 2025). These models are closely related in technique—continuous relaxations, randomized rounding, greedy repair, and bicriteria analysis—but they address different optimization geometries.

A further boundary concerns objective-versus-constraint placement. The SCSC/SCSK framework was motivated precisely by the observation that applications such as sensor placement and data subset selection require maximizing one submodular function while simultaneously minimizing another, and that phrasing the problem as constrained optimization is more natural than minimizing a difference of submodular functions (Iyer et al., 2013). In this sense, modern work on multiple submodular covering constraints sits at the intersection of submodular cover, robust optimization, and fairness-aware discrete optimization: the common theme is simultaneous satisfaction of several structured requirements, while the main technical divide is whether multiplicity appears in the lower-bound constraints, in the resource system, in the objective, or across time.