Combinatorial approximation algorithms for the maximum bounded connected bipartition problem (Q2111532): Difference between revisions

@@ Property / cites work @@
+Max-min partitioning of grid graphs into connected components
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm for max-min partitioning of ladders
+Normal rank
@@ Property / cites work @@
+Shifting algorithms for tree partitioning with general weighting functions
+Normal rank
@@ Property / cites work @@
+Q5387695
@@ Property / cites work: Q5387695 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the maximally balanced connected graph tripartition problem
+Normal rank
@@ Property / cites work @@
+Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for maximally balanced connected graph partition
+Normal rank
@@ Property / cites work @@
+Approximating the Maximally Balanced Connected Partition Problem in graphs
+Normal rank
@@ Property / cites work @@
+A Parallel Machine Scheduling Problem Maximizing Total Weighted Early Work
+Normal rank
@@ Property / cites work @@
+Computing an st-numbering
@@ Property / cites work: Computing an st-numbering / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds for Certain Multiprocessing Anomalies
@@ Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank @@
+Normal rank
@@ Property / cites work @@
+A common approximation framework for early work, late work, and resource leveling problems
+Normal rank
@@ Property / cites work @@
+Q5596083
@@ Property / cites work: Q5596083 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the maximum bounded connected bipartition problem
+Normal rank
@@ Property / cites work @@
+Most uniform path partitioning and its use in image processing
+Normal rank
@@ Property / cites work @@
+Doubly Balanced Connected Graph Partitioning
@@ Property / cites work: Doubly Balanced Connected Graph Partitioning / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work
+Normal rank
@@ Property / cites work @@
+A 7/6-Approximation Algorithm for the Max-Min Connected Bipartition Problem on Grid Graphs
+Normal rank
@@ Property / cites work @@
+FULLY POLYNOMIAL-TIME APPROXIMATION SCHEMES FOR THE MAX–MIN CONNECTED PARTITION PROBLEM ON INTERVAL GRAPHS
+Normal rank
@@ Property / cites work @@
+Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs
+Normal rank
@@ Property / cites work @@
+A heuristic algorithm for the mini-max spanning forest problem
+Normal rank
@@ Property / cites work @@
+Semi-online early work maximization problem on two hierarchical machines with partial information of processing time
+Normal rank
@@ Property / cites work @@
+Online early work maximization problem on two hierarchical machines with buffer or rearrangements
+Normal rank