Complexity and approximation of the connected set-cover problem (Q453623): Difference between revisions

@@ Property / DOI @@
-.1007/s10898-011-9726-x
@@ Property / DOI: 10.1007/s10898-011-9726-x / rank @@
-Normal rank
@@ Property / author @@
-Won Jun Lee
@@ Property / author: Won Jun Lee / rank @@
-Normal rank
@@ Property / author @@
+Won Jun Lee
@@ Property / author: Won Jun Lee / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C35
@@ Property / Mathematics Subject Classification ID: 90C35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C27
@@ Property / Mathematics Subject Classification ID: 90C27 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C59
@@ Property / Mathematics Subject Classification ID: 90C59 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6087676
@@ Property / zbMATH DE Number: 6087676 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+connected set-cover
@@ Property / zbMATH Keywords: connected set-cover / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+computational complexity
@@ Property / zbMATH Keywords: computational complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+approximation algorithms
@@ Property / zbMATH Keywords: approximation algorithms / 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/s10898-011-9726-x
+Normal rank
@@ Property / OpenAlex ID @@
+W2099799577
@@ Property / OpenAlex ID: W2099799577 / rank @@
+Normal rank
@@ Property / cites work @@
+Connected Set Cover Problem and Its Applications
@@ Property / cites work: Connected Set Cover Problem and Its Applications / rank @@
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+A Greedy Heuristic for the Set-Covering Problem
@@ Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Polylogarithmic inapproximability
@@ Property / cites work: Polylogarithmic inapproximability / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10898-011-9726-X
@@ Property / DOI: 10.1007/S10898-011-9726-X / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:453623