A note on the submodular vertex cover problem with submodular penalties (Q730006): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.tcs.2016.10.017 / rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2016.10.017 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2554369515 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Submodular Function Minimization under Covering Constraints / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Improved approximation algorithms for the facility location problems with linear/submodular penalties / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.TCS.2016.10.017 / rank | |||
Normal rank |
Latest revision as of 02:23, 10 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on the submodular vertex cover problem with submodular penalties |
scientific article |
Statements
A note on the submodular vertex cover problem with submodular penalties (English)
0 references
23 December 2016
0 references
submodular functions
0 references
vertex cover problem
0 references
set cover problem
0 references