An Approximate Algorithm for the Partitionable Independent Task Scheduling Problem
暂无分享,去创建一个
[1] C. Pandu Rangan,et al. Linear Algorithm for Optimal Path Cover Problem on Interval Graphs , 1990, Inf. Process. Lett..
[2] Sukhamay Kundu,et al. A Linear Algorithm for the Hamiltonian Completion Number of a Tree , 1976, Inf. Process. Lett..
[3] Ronald L. Graham,et al. Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.
[4] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .
[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[6] Prithviraj Banerjee,et al. A parallel algorithm for hierarchical circuit extraction , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.
[7] Shlomo Moran,et al. Optimal Covering of Cacti by Vertex-Disjoint Paths , 1991, Theor. Comput. Sci..
[8] J. A. McHugh,et al. On covering the points of a graph with point disjoint paths , 1974 .
[9] Peter J. Slater,et al. Advances on the Hamiltonian Completion Problem , 1975, JACM.