Algorithmic Chernoff-Hoeffding inequalities in integer programming
Random Structures & Algorithms
Fractional and integral colourings
Mathematical Programming: Series A and B
Tight approximations for resource constrained scheduling and bin packing
Proceedings of the 4th Twente workshop on Graphs and combinatorial optimization
Zero knowledge and the chromatic number
Journal of Computer and System Sciences - Eleventh annual conference on structure and complexity 1996
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
On multi-dimensional packing problems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Linear-time approximation schemes for scheduling malleable parallel tasks
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
Journal of the ACM (JACM)
Polynomial-time approximation schemes for geometric graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Scheduling in Computer and Manufacturing Systems
Scheduling in Computer and Manufacturing Systems
Preemptive Scheduling on Dedicated Processors: Applications of Fractional Graph Coloring
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Fractional Path Coloring with Applications to WDM Networks
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
JCDCG '98 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
The round-up property of the fractional chromatic number for proper circular arc graphs
Journal of Graph Theory
An efficient approximation scheme for the one-dimensional bin-packing problem
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Independence and coloring problems on intersection graphs of disks
Efficient Approximation and Online Algorithms
| Hi-index | 0.00 |
In this paper we show that approximation algorithms for the weighted independent set and s-dimensional knapsack problem with ratio a can be turned into approximation algorithms with the same ratio for fractional weighted graph coloring and preemptive resource constrained scheduling. In order to obtain these results, we generalize known results by Gr枚tschel, Lovasz and Schrijver on separation, non-emptiness test, optimization and violation in the direction of approximability.