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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2285, Issue , 2002, Pages 100-111

  Jansen, Klaus ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; GRAPH THEORY; SCHEDULING;

APPROXIMABILITY; GRAPH COLORINGS; KNAPSACK PROBLEMS; PRE-EMPTIVE SCHEDULING; RESOURCE CONSTRAINED SCHEDULING; STRONG SEPARATIONS; WEIGHTED GRAPH; WEIGHTED INDEPENDENT SETS;

APPROXIMATION ALGORITHMS;

EID: 36849038230     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45841-7_7     Document Type: Conference Paper

References (31)

1. J. Blazewicz, W. Cellary, R. Slowinski and J. Weglarz, Scheduling under resource constraints - deterministic models, Annals of Operations Research 7 (1986).
2. J. Blazewicz, K.H. Ecker, E. Pesch, G. Schmidt and J. Weglarz, Scheduling in Computer and Manufacturing Systems, Springer Verlag, Berlin (1996).
3. J. Blazewicz, J.K. Lenstra and A.H.G. Rinnooy Kan, Scheduling subject to resource constraints: Classification and Complexity, Discrete Applied Mathematics 5 (1983), 11-24.
4. A. Caprara, H. Kellerer, U. Pferschy and D. Pisinger, Approximation algorithms for knapsack problems with cardinaliy constraints, European Journal of Operational Research 123 (2000), 333-345.
5. I. Caragiannis, A. Ferreira, C. Kaklamanis, S. Perennes and H. Rivano, Fractional path coloring with applications to WDM networks, 28th International Colloquium on Automata, Languages and Programming ICALP 2001, LNCS 2076, Springer Verlag, 732-743.
6. C. Chekuri and S. Khanna, On multi-dimensional packing problems, Proceedings 10th ACM-SIAM Symposium on Discrete Algorithms SODA 1999, 185-194.
7. W.F. de la Vega and C.S. Lueker, Bin packing can be solved within 1 + e in linear time, Combinatorica 1 (1981), 349-355.
8. T. Erlebach and K. Jansen, Conversion of coloring algorithms into maximum weight independent set algorithms, Workshop on Approximation and Randomization Algorithms in Communication Networks (2000), Carleton Scientific, 135-146.
9. T. Erlebach, K. Jansen and E. Seidel, Polynomial-time approximation schemes for geometric graphs, Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms (2001), 671-679.
10. U. Feige and J. Kilian, Zero knowledge and the chromatic number, Journal of Computer and System Sciences 57 (1998), 187-199.
11. A.M. Frieze and M.R.B. Clarke, Approximation algorithms for the m-dimensional 0 - 1 knapsack problem, European Journal of Operational Research 15 (1984), 100-109.
12. M.R. Garey and R.L. Graham, Bounds for multiprocessor scheduling with resource constraints, SIAM Journal on Computing 4 (1975), 187-200.
13. M.R. Garey, R.L. Graham, D.S. Johnson and A.C.-C. Yao, Resource constrained scheduling as generalized bin packing, Journal Combinatorial Theory A 21 (1976), 251-298.
14. S. Gerke and C. McDiarmid, Graph imperfection, unpublished manuscript, 2000.
15. M. Grötschel, L. Lovász and A. Schrijver, The ellipsoid method and its consequences in combinatorial optimization, Combinatorica 1 (1981), 169-197.
16. M. Grötschel, L. Lovász and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer Verlag, Berlin (1988).
17. K. Jansen and L. Porkolab, Linear-time approximation schemes for scheduling malleable parallel tasks, Proceedings 10th ACM-SIAM Symposium on Discrete Algorithms SODA 1999, 490-498, and Algorithmica, to appear.
18. K. Jansen and L. Porkolab, Computing Optimal Preemptive Schedules for Parallel Tasks: Linear Programming Approaches, Proceedings 11th Annual International Symposium on Algorithms and Computation ISAAC 2000, LNCS 1969, Springer Verlag, 398-409, and Mathematical Programming, to appear.
19. K. Jansen and L. Porkolab, Preemptive scheduling on dedicated processors: applications of fractional graph coloring Proceedings 25th International Symposium on Mathematical Foundations of Computer Science MFCS 2000, LNCS 1893, Springer Verlag, 446-455.
20. K. Jansen and L. Porkolab, On preemptive resource constrained scheduling: polynomial time approximation schemes, unpublished manuscript, 2001.
21. N. Karmarkar and R.M. Karp, An efficient approximation scheme for the one-dimensional bin-packing problem, Proceedings of 23rd IEEE Symposium on Foundations of Computer Science FOCS 1982, 206-213.
22. K. Kilakos and O. Marcotte, Fractional and integral colourings, Mathematical Programming 76 (1997), 333-347.
23. K.L. Krause, V.Y. Shen and H.D. Schwetman, Analysis of several task scheduling algorithms for a model of multiprogramming computer systems, Journal of the ACM 22 (1975), 522-550 and Errata, Journal of the ACM 24 (1977), 527.
24. C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, Journal of the ACM 41 (1994), 960-981.
25. O. Oguz and M.J. Magazine, A polynomial time approximation algorithm for the multidimensional 0 - 1 knapsack problem, working paper, University of Waterloo, 1980.
26. T. Matsui, Approximation algorithms for maximum independent set problems and fractional coloring problems on unit disk graphs, Proceedings Symposium on Discrete and Compuational Geometry, LNCS 1763 (2000), Springer Verlag, 194-200.
27. T. Niessen and J. Kind, The round-up property of the fractional chromatic number for proper circular arc graphs, Journal of Graph Theory 33 (2000), 256-267.
28. E.R. Schreinerman and D.H. Ullman, Fractional graph theory: A rational approach to the theory of graphs, Wiley Interscience Series in Discrete Mathematics (1997).
29. P.D. Seymour, Colouring series-parallel graphs, Combinatorica 10(1990), 379-392.
30. A. Srivastav and P. Stangier, Algorithmic Chernoff-Hoeffding inequalities in integer programming, Random Structures and Algorithms 8(1) (1996), 27-58.
31. A. Srivastav and P. Stangier, Tight approximations for resource constrained scheduling and bin packing, Discrete Applied Mathematics 79 (1997), 223-245.