Scheduling with conflicts: online and offline algorithms
暂无分享,去创建一个
Dana Ron | Magnús M. Halldórsson | Guy Even | Lotem Kaplan | D. Ron | M. Halldórsson | G. Even | L. Kaplan
[1] Leah Epstein,et al. On Bin Packing with Conflicts , 2006, SIAM J. Optim..
[2] David Zuckerman,et al. Electronic Colloquium on Computational Complexity, Report No. 100 (2005) Linear Degree Extractors and the Inapproximability of MAX CLIQUE and CHROMATIC NUMBER , 2005 .
[3] Mikkel Thorup,et al. OPT versus LOAD in dynamic storage allocation , 2003, STOC '03.
[4] Sandy Irani,et al. Scheduling with Conflicts on Bipartite and Interval Graphs , 2003, J. Sched..
[5] Guy Kortsarz,et al. Multicoloring trees , 2003, Inf. Comput..
[6] K. Jansen,et al. Polynomial time approximation schemes for general multiprocessor job shop scheduling , 2002, J. Algorithms.
[7] Guy Kortsarz,et al. Sum Multicoloring of Graphs , 2000, J. Algorithms.
[8] Klaus Jansen,et al. An Approximation Scheme for Bin Packing with Conflicts , 1998, J. Comb. Optim..
[9] Klaus Jansen,et al. The mutual exclusion scheduling problem for permutation and comparability graphs , 1998, Inf. Comput..
[10] Rong-chii Duh,et al. Approximation of k-set cover by semi-local optimization , 1997, STOC '97.
[11] SCHEDULING WITH CONFLICTS , 1997 .
[12] Maciej Drozdowski,et al. Scheduling multiprocessor tasks -- An overview , 1996 .
[13] O. E. Flippo,et al. Duality and sensitivity in nonconvex quadratic optimization over an ellipsoid , 1996 .
[14] Edward G. Coffman,et al. Mutual Exclusion Scheduling , 1996, Theor. Comput. Sci..
[15] Uriel Feige,et al. Zero knowledge and the chromatic number , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).
[16] Klaus Jansen,et al. Restrictions of Graph Partition Problems. Part I , 1995, Theor. Comput. Sci..
[17] Michael R. Fellows,et al. FIXED-PARAMETER TRACTABILITY AND COMPLETENESS , 2022 .
[18] Klaus Jansen,et al. On the Complexity of Scheduling Incompatible Jobs with Unit-Times , 1993, MFCS.
[19] Erez Petrank,et al. The hardness of approximation: Gap location , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.
[20] Pierre Hansen,et al. Bounded vertex colorings of graphs , 1990, Discret. Math..
[21] H. Bodlaender,et al. Restrictions of Graph Partition Problems , 1993 .
[22] Klaus Jansen,et al. Scheduling with Incompatible Jobs , 1992, Discret. Appl. Math..
[23] David P. Williamson,et al. Scheduling parallel machines on-line , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[24] Zbigniew Lonc,et al. On Complexity of Some Chain and Antichain Partition Problems , 1991, WG.
[25] Gunther Schmidt,et al. Proceedings of the 17th International Workshop , 1991 .
[26] Edward G. Coffman,et al. Scheduling File Transfers , 1985, SIAM J. Comput..
[27] T. J. Mclarnan,et al. The coloring problem , 1985 .
[28] Noga Alon,et al. A note on the decomposition of graphs into isomorphic matchings , 1983 .
[29] Magyar Tudományos Akadémia. Acta mathematica Hungarica , 1983 .
[30] M. Garey. Johnson: computers and intractability: a guide to the theory of np- completeness (freeman , 1979 .
[31] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[32] David S. Johnson,et al. Complexity Results for Multiprocessor Scheduling under Resource Constraints , 1975, SIAM J. Comput..
[33] Ronald L. Graham,et al. Bounds for Multiprocessor Scheduling with Resource Constraints , 1975, SIAM J. Comput..