Improving multicut in directed trees by upgrading nodes (Q2643926): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2005.12.044
+Normal rank
@@ Property / OpenAlex ID @@
+W1983608172
@@ Property / OpenAlex ID: W1983608172 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal multicut and maximal integer multiflow: a survey
+Normal rank
@@ Property / cites work @@
+Multiway cuts in node weighted graphs
@@ Property / cites work: Multiway cuts in node weighted graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A class of node based bottleneck improvement problems
+Normal rank
@@ Property / cites work @@
+Discrete Mathematics
@@ Property / cites work: Discrete Mathematics / rank @@
+Normal rank
@@ Property / cites work @@
+Communication-efficient parallel algorithms for distributed random-access machines
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for certain network improvement problems
+Normal rank
@@ Property / cites work @@
+Improving Minimum Cost Spanning Trees by Upgrading Nodes
+Normal rank
@@ Property / cites work @@
+Upgrading bottleneck constrained forests
@@ Property / cites work: Upgrading bottleneck constrained forests / rank @@
+Normal rank
@@ Property / cites work @@
+Improving spanning trees by upgrading nodes
@@ Property / cites work: Improving spanning trees by upgrading nodes / rank @@
+Normal rank