An approximation algorithm for submodular hitting set problem with linear penalties (Q830939): Difference between revisions

@@ Property / DOI @@
-.1007/s10878-020-00653-6
@@ Property / DOI: 10.1007/s10878-020-00653-6 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-020-00653-6
+Normal rank
@@ Property / OpenAlex ID @@
+W3088443916
@@ Property / OpenAlex ID: W3088443916 / rank @@
+Normal rank
@@ Property / cites work @@
+Hitting Set for hypergraphs of low VC-dimension
@@ Property / cites work: Hitting Set for hypergraphs of low VC-dimension / rank @@
+Normal rank
@@ Property / cites work @@
+Practical and efficient algorithms for the geometric hitting set problem
+Normal rank
@@ Property / cites work @@
+Identifying the Minimal Transversals of a Hypergraph and Related Problems
+Normal rank
@@ Property / cites work @@
+A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs
+Normal rank
@@ Property / cites work @@
+Submodular functions and optimization.
@@ Property / cites work: Submodular functions and optimization. / rank @@
+Normal rank
@@ Property / cites work @@
+Foundations of Information and Knowledge Systems
@@ Property / cites work: Foundations of Information and Knowledge Systems / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
+Normal rank
@@ Property / cites work @@
+A 5-approximation algorithm for the \(k\)-prize-collecting Steiner tree problem
+Normal rank
@@ Property / cites work @@
+Submodular Function Minimization under Covering Constraints
+Normal rank
@@ Property / cites work @@
+Approximate Set Covering in Uniform Hypergraphs
@@ Property / cites work: Approximate Set Covering in Uniform Hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+A combinatorial 2.375-approximation algorithm for the facility location problem with submodular penalties
+Normal rank
@@ Property / cites work @@
+A unified dual-fitting approximation algorithm for the facility location problems with linear/submodular penalties
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for the facility location problems with linear/submodular penalties
+Normal rank
@@ Property / cites work @@
+\(\mathsf{NP}\)-hardness of geometric set cover and hitting set with rectangles containing a common point
+Normal rank
@@ Property / cites work @@
+On approximation of the vertex cover problem in hypergraphs
+Normal rank
@@ Property / cites work @@
+A randomised approximation algorithm for the hitting set problem
+Normal rank
@@ Property / cites work @@
+Q3910298
@@ Property / cites work: Q3910298 / rank @@
+Normal rank
@@ Property / cites work @@
+Greedy approximations for minimum submodular cover with submodular cost
+Normal rank
@@ Property / cites work @@
+The primal-dual method for approximation algorithms
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique
+Normal rank
@@ Property / DOI @@
+.1007/S10878-020-00653-6
@@ Property / DOI: 10.1007/S10878-020-00653-6 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:830939