Approximate strong separation with application in fractional graph coloring and preemptive scheduling

Authors:
Klaus Jansen
Affiliations:
Institut für Informatik und praktische Mathematik, Christian-Albrechts-Universität Kiel, Olshausenstr. 40, 24098 Kiel, Germany
Venue:
Theoretical Computer Science
Year:
2003

Citing 14
Cited 4

Algorithmic Chernoff-Hoeffding inequalities in integer programming

Random Structures & Algorithms
Scheduling computer and manufacturing processes

Scheduling computer and manufacturing processes
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
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
Graph imperfection II

Journal of Combinatorial Theory Series B
On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs

JCDCG '98 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial-Time Approximation Scheme

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
The round-up property of the fractional chromatic number for proper circular arc graphs

Journal of Graph Theory

On the complexity of bandwidth allocation in radio networks

Theoretical Computer Science
Multiflows in multihop wireless networks

Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Coordinating concurrent transmissions: a constant-factor approximation of maximum-weight independent set in local conflict graphs

ADHOC-NOW'07 Proceedings of the 6th international conference on Ad-hoc, mobile and wireless networks
An investigation on the nature of wireless scheduling

INFOCOM'10 Proceedings of the 29th conference on Information communications

Quantified Score

Hi-index	5.23

Visualization

Abstract

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.