A note on the submodular vertex cover problem with submodular penalties
From MaRDI portal
Publication:730006
DOI10.1016/J.TCS.2016.10.017zbMath1357.68295OpenAlexW2554369515MaRDI QIDQ730006
Publication date: 23 December 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.10.017
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Approximation algorithms (68W25)
Related Items (2)
Approximation algorithms for the submodular edge cover problem with submodular penalties ⋮ Combinatorial approximation algorithms for the submodular multicut problem in trees with submodular penalties
Cites Work
This page was built for publication: A note on the submodular vertex cover problem with submodular penalties