A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints (Q5091245): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| label / en | label / en | ||
A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints | |||
| Property / DOI | |||
| Property / DOI: 10.4230/LIPIcs.ICALP.2019.85 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2965600716 / rank | |||
Normal rank | |||
| Property / title | |||
A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints (English) | |||
| Property / title: A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints (English) / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.4230/LIPICS.ICALP.2019.85 / rank | |||
Normal rank | |||
Latest revision as of 15:53, 30 December 2024
scientific article; zbMATH DE number 7561578
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints |
scientific article; zbMATH DE number 7561578 |
Statements
21 July 2022
0 references
submodular function
0 references
approximation algorithm
0 references
covering
0 references
packing
0 references
0 references
0 references
0 references
0 references
A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints (English)
0 references
