Skip to main content
SpringerLink
Log in

“Rent-or-Buy” Scheduling and Cost Coloring Problems

  • Conference paper
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4855))

Abstract

We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the costs of the color classes. The “Rent-or-Buy” scheduling/coloring problem (RBC) is one that, e.g., captures job scheduling situations involving resource constraints where one can either pay a full fixed price for a color class (representing e.g., a server), or a small per-item charge for each vertex in the class (corresponding to jobs that are either not served, or are farmed out to an outside agency). We give exact and approximation algorithms for RBC and three other cost coloring problems (including the previously studied Probabilistic coloring problem), both on interval and on perfect graphs. The techniques rely heavily on the computation of maximum weight induced k-colorable subgraphs (k-MCS). We give a novel bicriteria approximation for k-MCS in perfect graphs, and extend the known exact algorithm for interval graphs to some problem extensions.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Arkin, E.M., Silverberg, E.B.: Scheduling jobs with fixed start and end times. Disc. Applied Math. 18, 1–8 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bodlaender, H., Jansen, K.: Restrictions of graph partition problems. Part I. Theoretical Computer Science 148, 93–109 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  3. Cardinal, J., Fiorini, S., Joret, G.: Minimum entropy coloring. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 819–828. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  4. Della Croce, F., Escoffier, B., Murat, C., Paschos, V.T.: Probabilistic coloring of bipartite and split graphs. In: Gervasi, O., Gavrilova, M., Kumar, V., Laganà, A., Lee, H.P., Mun, Y., Taniar, D., Tan, C.J.K. (eds.) ICCSA 2005. LNCS, vol. 3480, pp. 202–211. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  5. Epstein, L., Halldórsson, M.M., Levin, A., Shachnai, H.: Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs. In: Díaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol. 4110, pp. 116–127. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  6. Escoffier, B., Monnot, J., Paschos, V.T.: Weighted Coloring: Further complexity and approximability results. Inf. Process. Lett. 97(3), 98–103 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  7. Feige, U.: Approximating Maximum Clique by Removing Subgraphs. SIAM J. Discrete Math. 18(2), 219–225 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  8. Feige, U., Kilian, J.: Zero knowledge and the chromatic number. JCSS 57, 187–199 (1998)

    MathSciNet  MATH  Google Scholar 

  9. Fomin, F.V., Kratsch, D., Novelli, J.-C.: Approximating minimum cocolorings. Inf. Process. Lett. 84(5), 285–290 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  10. Frank, A.: On chain and antichain families of a partially ordered set. Journal of Combinatorial Theory Series B 29, 176–184 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  11. Fukunaga, T., Halldórsson, M.M., Nagamochi, H.: Robust cost colorings. In: SODA (2008)

    Google Scholar 

  12. Gijswijt, D., Jost, V., Queyranne, M.: Clique partitioning of interval graphs with submodular costs on the cliques. EGRES TR 2006-14, www.cs.elte.hu/egres

  13. Halldórsson, M.M.: A still better performance guarantee for approximate graph coloring. Inform. Process. Lett. 45, 19–23 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  14. Halldórsson, M.M., Kortsarz, G., Shachnai, H.: Sum coloring interval and k-claw free graphs with application to scheduling dependent jobs. Algorithmica 37, 187–209 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  15. Iri, M.: Network Flow, Transportation, and Scheduling: Theory and Algorithms. Academic Press, London (1969)

    MATH  Google Scholar 

  16. Jansen, K.: Approximation Results for the Optimum Cost Chromatic Partition Problem. J. Algorithms 34, 54–89 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  17. Murat, C., Paschos, V.Th.: On the probabilistic minimum coloring and minimum k-coloring. Disc. Appl. Math. 154, 564–586 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  18. Pemmaraju, S.V., Raman, R.: Approximation Algorithms for the Max-coloring Problem. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, Springer, Heidelberg (2005)

    Google Scholar 

  19. Saha, A., Pal, M.: Maximum weight k-independent set problem on permutation graphs. Int. J. Comput. Math. 80(12), 1477–1487 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  20. Yannakakis, M., Gavril, F.: The maximum k-colorable subgraph problem for chordal graphs. Information Processing Letters 24(2), 133–137 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  21. Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. In: STOC, pp. 681–690 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept.of Applied Math. and Physics, Graduate School of Informatics, Kyoto University, Japan

    Takuro Fukunaga & Hiroshi Nagamochi

  2. School of Computer Science, Reykjavik University, Iceland

    Magnús M. Halldórsson

Authors
  1. Takuro Fukunaga
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Magnús M. Halldórsson
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hiroshi Nagamochi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

V. Arvind Sanjiva Prasad

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fukunaga, T., Halldórsson, M.M., Nagamochi, H. (2007). “Rent-or-Buy” Scheduling and Cost Coloring Problems. In: Arvind, V., Prasad, S. (eds) FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2007. Lecture Notes in Computer Science, vol 4855. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77050-3_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77050-3_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77049-7

  • Online ISBN: 978-3-540-77050-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation