Approximability of partitioning graphs with supply and demand (Q1002107): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jda.2008.03.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2172083980
@@ Property / OpenAlex ID: W2172083980 / rank @@
+Normal rank
@@ Property / cites work @@
+Easy problems for tree-decomposable graphs
@@ Property / cites work: Easy problems for tree-decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
+Normal rank
@@ Property / cites work @@
+Approximability of Partitioning Graphs with Supply and Demand
+Normal rank
@@ Property / cites work @@
+PARTITIONING TREES OF SUPPLY AND DEMAND
@@ Property / cites work: PARTITIONING TREES OF SUPPLY AND DEMAND / rank @@
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+Linear-time computability of combinatorial problems on series-parallel graphs
+Normal rank