An approximation algorithm for the license and shift class design problem (Q1328603): Difference between revisions

@@ Property / cites work @@
+A Greedy Heuristic for the Set-Covering Problem
@@ Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Games of Boldness, Where the Player Performing the Hardest Task Wins
+Normal rank
@@ Property / cites work @@
+Minimal Resources for Fixed and Variable Job Schedules
+Normal rank
@@ Property / cites work @@
+An Optimal Solution for the Channel-Assignment Problem
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for interval graphs and circular-arc graphs
+Normal rank
@@ Property / cites work @@
+Processor optimization for flow graphs
@@ Property / cites work: Processor optimization for flow graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational complexity of (maximum) class scheduling
+Normal rank