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

Theoretical Computer Science

Volumn 302, Issue 1-3, 2003, Pages 239-256

  Jansen, Klaus ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

Approximation of separation; Fractional graph coloring; Optimization and violation; Preemptive scheduling

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER PROGRAMMING; COMPUTER SIMULATION; CONSTRAINT THEORY; SCHEDULING;

PREEMPTIVE SCHEDULING;

GRAPH THEORY;

EID: 0038577271     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00829-0     Document Type: Article

References (33)

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