Complexity and approximation of the constrained forest problem (Q553340): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q17
@@ Property / Mathematics Subject Classification ID: 68Q17 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C85
@@ Property / Mathematics Subject Classification ID: 05C85 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+5932524
@@ Property / zbMATH DE Number: 5932524 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+complexity
@@ Property / zbMATH Keywords: complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+approximation
@@ Property / zbMATH Keywords: approximation / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+APX-hardness
@@ Property / zbMATH Keywords: APX-hardness / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+constrained forest
@@ Property / zbMATH Keywords: constrained forest / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+ptas
@@ Property / zbMATH Keywords: ptas / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+bipartite graphs
@@ Property / zbMATH Keywords: bipartite graphs / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+planar graphs
@@ Property / zbMATH Keywords: planar graphs / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+treewidth
@@ Property / zbMATH Keywords: treewidth / 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.tcs.2010.07.018
+Normal rank
@@ Property / OpenAlex ID @@
+W2039500680
@@ Property / OpenAlex ID: W2039500680 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for NP-complete problems on planar graphs
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+Complexity of approximating bounded variants of optimization problems
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
+Normal rank
@@ Property / cites work @@
+Planar 3DM is NP-complete
@@ Property / cites work: Planar 3DM is NP-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Matching, Euler tours and the Chinese postman
@@ Property / cites work: Matching, Euler tours and the Chinese postman / rank @@
+Normal rank
@@ Property / cites work @@
+Q3270978
@@ Property / cites work: Q3270978 / rank @@
+Normal rank
@@ Property / cites work @@
+A General Approximation Technique for Constrained Forest Problems
+Normal rank
@@ Property / cites work @@
+A greedy heuristic for a minimum-weight forest problem
+Normal rank
@@ Property / cites work @@
+Treewidth. Computations and approximations
@@ Property / cites work: Treewidth. Computations and approximations / rank @@
+Normal rank
@@ Property / cites work @@
+Another greedy heuristic for the constrained forest problem
+Normal rank
@@ Property / cites work @@
+A class of heuristics for the constrained forest problem
+Normal rank
@@ Property / cites work @@
+The path partition problem and related problems in bipartite graphs
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+Graph minors. X: Obstructions to tree-decomposition
+Normal rank
@@ Property / cites work @@
+Q3330973
@@ Property / cites work: Q3330973 / rank @@
+Normal rank
@@ Property / cites work @@
+Extensions of Gallai's graph covering theorems for uniform hypergraphs
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:553340