Pages that link to "Item:Q2165261"
From MaRDI portal
The following pages link to Algorithms for covering multiple submodular constraints and applications (Q2165261):
Displaying 8 items.
- New algorithms for the intersection problem of submodular systems (Q1202762) (← links)
- Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost (Q1949749) (← links)
- A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem (Q2282997) (← links)
- All-Norms and All-L_p-Norms Approximation Algorithms (Q3165959) (← links)
- Prize‐collecting set multicovering with submodular pricing (Q5374518) (← links)
- A bicriteria approximation algorithm for minimum submodular cost partial multi-cover problem (Q6049083) (← links)
- Approximation algorithm for prize-collecting vertex cover with fairness constraints (Q6646739) (← links)
- On approximating partial scenario set cover (Q6652422) (← links)