Approximate strong separation with application in fractional graph coloring and preemptive scheduling. (Q1401329): Difference between revisions

@@ Property / cites work @@
+Q3821925
@@ Property / cites work: Q3821925 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4380372
@@ Property / cites work: Q4380372 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling subject to resource constraints: Classification and complexity
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for knapsack problems with cardinality constraints
+Normal rank
@@ Property / cites work @@
+Q4535060
@@ Property / cites work: Q4535060 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252288
@@ Property / cites work: Q4252288 / rank @@
+Normal rank
@@ Property / cites work @@
+Bin packing can be solved within 1+epsilon in linear time
+Normal rank
@@ Property / cites work @@
+Q2768362
@@ Property / cites work: Q2768362 / rank @@
+Normal rank
@@ Property / cites work @@
+Zero knowledge and the chromatic number
@@ Property / cites work: Zero knowledge and the chromatic number / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
+Normal rank
@@ Property / cites work @@
+Bounds for Multiprocessor Scheduling with Resource Constraints
+Normal rank
@@ Property / cites work @@
+Resource constrained scheduling as generalized bin packing
+Normal rank
@@ Property / cites work @@
+Graph imperfection. I
@@ Property / cites work: Graph imperfection. I / rank @@
+Normal rank
@@ Property / cites work @@
+The ellipsoid method and its consequences in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Q4411391
@@ Property / cites work: Q4411391 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-Time approximation schemes for scheduling malleable parallel tasks
+Normal rank
@@ Property / cites work @@
+Q4472514
@@ Property / cites work: Q4472514 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4536380
@@ Property / cites work: Q4536380 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4737537
@@ Property / cites work: Q4737537 / rank @@
+Normal rank
@@ Property / cites work @@
+Fractional and integral colourings
@@ Property / cites work: Fractional and integral colourings / rank @@
+Normal rank
@@ Property / cites work @@
+Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating minimization problems
+Normal rank
@@ Property / cites work @@
+Q4504025
@@ Property / cites work: Q4504025 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4948754
@@ Property / cites work: Q4948754 / rank @@
+Normal rank
@@ Property / cites work @@
+A fully polynomial approximation algorithm for the 0-1 knapsack problem
+Normal rank
@@ Property / cites work @@
+Q4382863
@@ Property / cites work: Q4382863 / rank @@
+Normal rank
@@ Property / cites work @@
+Colouring series-parallel graphs
@@ Property / cites work: Colouring series-parallel graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4868265
@@ Property / cites work: Q4868265 / rank @@
+Normal rank
@@ Property / cites work @@
+Tight approximations for resource constrained scheduling and bin packing
+Normal rank