Skip to main content
SpringerLink
Log in

Approximate Strong Separation with Application in Fractional Graph Coloring and Preemptive Scheduling

  • Conference paper
  • First Online:
STACS 2002 (STACS 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2285))

Included in the following conference series:

Abstract

In this paper we show that approximation algorithms for the weighted independent set and s-dimensional knapsack problem with ratio α 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.

Research of the author was supported in part by the EU Thematic Network APPOL, Approximation and Online Algorithms, IST-1999-14084 and by the EU Research Training Network ARACNE, Approximation and Randomized Algorithms in Communication Networks, HPRN-CT-1999-00112.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Blazewicz, W. Cellary, R. Slowinski and J. Weglarz, Scheduling under resource constraints — deterministic models, Annals of Operations Research 7 (1986).

    Google Scholar 

  2. J. Blazewicz, K.H. Ecker, E. Pesch, G. Schmidt and J. Weglarz, Scheduling in Computer and Manufacturing Systems, Springer Verlag, Berlin (1996).

    Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Chapter  Google Scholar 

  6. C. Chekuri and S. Khanna, On multi-dimensional packing problems, Proceedings 10th ACM-SIAM Symposium on Discrete Algorithms SODA 1999, 185–194.

    Google Scholar 

  7. W.F. de la Vega and C.S. Lueker, Bin packing can be solved within 1+∈ in linear time, Combinatorica 1 (1981), 349–355.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  10. U. Feige and J. Kilian, Zero knowledge and the chromatic number, Journal of Computer and System Sciences 57 (1998), 187–199.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  12. M.R. Garey and R.L. Graham, Bounds for multiprocessor scheduling with resource constraints, SIAM Journal on Computing 4 (1975), 187–200.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    MathSciNet  Google Scholar 

  14. S. Gerke and C. McDiarmid, Graph imperfection, unpublished manuscript, 2000.

    Google Scholar 

  15. M. Grötschel, L. Lovász and A. Schrijver, The ellipsoid method and its consequences in combinatorial optimization, Combinatorica 1 (1981), 169–197.

    Article  MATH  MathSciNet  Google Scholar 

  16. M. Grötschel, L. Lovász and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer Verlag, Berlin (1988).

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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 ScienceMFCS 2000, LNCS 1893, Springer Verlag, 446–455.

    Google Scholar 

  20. K. Jansen and L. Porkolab, On preemptive resource constrained scheduling: polynomial time approximation schemes, unpublished manuscript, 2001.

    Google Scholar 

  21. N. Karmarkar and R.M. Karp, An efficient approximation scheme for the onedimensional bin-packing problem, Proceedings of 23rd IEEE Symposium on Foundations of Computer Science FOCS 1982, 206–213.

    Google Scholar 

  22. K. Kilakos and O. Marcotte, Fractional and integral colourings, Mathematical Programming 76 (1997), 333–347.

    MathSciNet  Google Scholar 

  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–550and Errata, Journal of the ACM 24 (1977), 527.

    Article  MATH  MathSciNet  Google Scholar 

  24. C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, Journal of the ACM 41 (1994), 960–981.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  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).

    Google Scholar 

  29. P.D. Seymour, Colouring series-parallel graphs, Combinatorica 10(1990 ), 379–392

    Article  MATH  MathSciNet  Google Scholar 

  30. A. Srivastav and P. Stangier, Algorithmic Chernoff-Hoeffding inequalities in integer programming, Random Structures and Algorithms 8(1) (1996), 27–58.

    Article  MATH  MathSciNet  Google Scholar 

  31. A. Srivastav and P. Stangier, Tight approximations for resource constrained scheduling and bin packing, Discrete Applied Mathematics 79 (1997), 223–245.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik und praktische Mathematik, Christian-Albrechts-Universität zu Kiel, 24 098, Kiel, Germany

    Klaus Jansen

Authors
  1. Klaus Jansen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Computer Science, Free University of Berlin, Takustraße 9, 14195, Berlin, Germany

    Helmut Alt

  2. CNRS - I3S - INRIA Sophia Antipolis, 2004 Route des Lucioles, 06902, Sophia Antipolis, France

    Afonso Ferreira

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-VerlagBerlin Heidelberg

About this paper

Cite this paper

Jansen, K. (2002). Approximate Strong Separation with Application in Fractional Graph Coloring and Preemptive Scheduling. In: Alt, H., Ferreira, A. (eds) STACS 2002. STACS 2002. Lecture Notes in Computer Science, vol 2285. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45841-7_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-45841-7_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43283-8

  • Online ISBN: 978-3-540-45841-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation