An approximation scheme for bin packing with conflicts

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

Volumn 1432, Issue , 1998, Pages 35-46

  Jansen, Klaus ^a  

^a DALLE MOLLE INSTITUTE FOR ARTIFICIAL INTELLIGENCE IDSIA   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BINS; GRAPH THEORY; GRAPHIC METHODS;

APPROXIMATION SCHEME; ASYMPTOTIC APPROXIMATION; BIN PACKING PROBLEM; CONFLICT GRAPH; GRAPH CLASS; NATURAL GENERALIZATION; PLANAR GRAPH; RUNNING TIME;

TREES (MATHEMATICS);

EID: 84957610071     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0054353     Document Type: Conference Paper

References (17)

1. B.S. Baker and E.G. Coffman, Mutual exclusion scheduling, Theoretical Computer Science, 162 (1996) 225-243.
2. P. Bjorstad, W.M. Coughran and E. Grosse: Parallel domain decomposition applied to coupled transport equations, in: Domain Decomposition Methods in Scientific and Engineering Computing (eds. D.E. Keys, J. Xu), AMS, Providence, 1995, 369-380.
3. H.L. Bodlaender and K. Jansen, On the complexity of scheduling incompatible jobs with unit-times, Mathematical Foundations of Computer Science, MFCS 93, LNCS 711,291-300.
4. E.G. Coffman Jr., M.R. Garey and D.S. Johnson, Approximation algorithms for bin-packing-a survey, in: Approximation algorithms for NP-hard problems (ed. D.S. Hochbaum), PWS Publishing, 1995, 49-106.
5. U. Feige and J. Kilian, Zero Knowledge and the chromatic number, Conference on Computational Complexity, CCC 96, 278-287.
6. W. Fernandez de la Vega and G.S. Lueker, Bin packing can be solved within 1 + ϵ in linear time, Combinatorica, 1 (1981) 349-355.
7. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, 1979.
8. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, London, 1980.
9. S. Irani, Coloring inductive graphs on-line, Algorithmica, 11 (1994) 53-72.
10. S. Irani and V. Leung, Scheduling with conflicts, and applications to traffic signal control, Symposium on Discrete Algorithms, SODA 96, 85-94.
11. S. Irani, Private communication.
12. K. Jansen and S. Öhring, Approximation algorithms for time constrained scheduling, Information and Computation, 132 (1997) 85-108.
13. K. Jansen, The mutual exclusion scheduling problem for permutation and comparability graphs, Symposium on Theoretical Aspects of Computer Science, STACS 98, LNCS 1373, 1998, 287-297.
14. D. Kaller, A. Gupta and T. Shermer: The Xt-coloring problem, Symposium on Theoretical Aspects of Computer Science, STACS 95, LNCS 900, 409-420.
15. N. Karmarkar and R.M. Karp, An efficient approximation scheme for the onedimensional bin packing problem, Symposium on the Foundations of Computer Science, FOCS 82, 312-320.
16. Z. Lonc: On complexity of some chain and antichain partition problem, Graph Theoretical Concepts in Computer Science, WG 91, LNCS 570, 97-104.
17. D. de Werra, An introduction to timetabling, European Journal of Operations Research, 19 (1985) 151-162.