An approximation result for the interval coloring problem on claw-free chordal graphs (Q1613366): Difference between revisions

@@ Property / cites work @@
+An Introduction to Combinatorial Models of Dynamic Storage Allocation
+Normal rank
@@ Property / cites work @@
+Q4944995
@@ Property / cites work: Q4944995 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2708486
@@ Property / cites work: Q2708486 / rank @@
+Normal rank
@@ Property / cites work @@
+An approximation result for a periodic allocation problem
+Normal rank
@@ Property / cites work @@
+An approximation result for a duo-processor task scheduling problem
+Normal rank
@@ Property / cites work @@
+Comparability graph augmentation for some multiprocessor scheduling problems
+Normal rank
@@ Property / cites work @@
+Efficiency and effectiveness of normal schedules on three dedicated processors
+Normal rank
@@ Property / cites work @@
+Characterizations of strongly chordal graphs
@@ Property / cites work: Characterizations of strongly chordal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252403
@@ Property / cites work: Q4252403 / rank @@
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for scheduling on three dedicated machines
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of scheduling independent two-processor tasks on dedicated processors
+Normal rank