Exact algorithms and applications for tree-like Weighted Set Cover (Q866547): Difference between revisions

@@ Property / DOI @@
-.1016/j.jda.2005.07.005
@@ Property / DOI: 10.1016/j.jda.2005.07.005 / 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.1016/j.jda.2005.07.005
+Normal rank
@@ Property / OpenAlex ID @@
+W2132377873
@@ Property / OpenAlex ID: W2132377873 / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
+Normal rank
@@ Property / cites work @@
+Tree Decompositions of Graphs: Saving Memory in Dynamic Programming
+Normal rank
@@ Property / cites work @@
+An Almost Linear-Time Algorithm for Graph Realization
+Normal rank
@@ Property / cites work @@
+Q4699283
@@ Property / cites work: Q4699283 / rank @@
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+Refined memorization for vertex cover
@@ Property / cites work: Refined memorization for vertex cover / rank @@
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4526990
@@ Property / cites work: Q4526990 / rank @@
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Algorithms and Data Structures
@@ Property / cites work: Algorithms and Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Primal-dual approximation algorithms for integral flow and multicut in trees
+Normal rank
@@ Property / cites work @@
+Q4779133
@@ Property / cites work: Q4779133 / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability and data reduction for multicut in trees
+Normal rank
@@ Property / cites work @@
+Approximating k-set cover and complementary graph coloring
+Normal rank
@@ Property / cites work @@
+Optimal Capacity Scheduling—I
@@ Property / cites work: Optimal Capacity Scheduling—I / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth. Computations and approximations
@@ Property / cites work: Treewidth. Computations and approximations / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2004
@@ Property / cites work: Algorithms – ESA 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4040221
@@ Property / cites work: Q4040221 / rank @@
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2004
@@ Property / cites work: Mathematical Foundations of Computer Science 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
+Normal rank
@@ Property / cites work @@
+Practical algorithms on partial k-trees with an application to domination-like problems
+Normal rank
@@ Property / cites work @@
+An Algorithm for Determining Whether a Given Binary Matroid is Graphic
+Normal rank
@@ Property / DOI @@
+.1016/J.JDA.2005.07.005
@@ Property / DOI: 10.1016/J.JDA.2005.07.005 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:866547