Shortest Common Superstrings and Scheduling with Coordinated Starting Times
暂无分享,去创建一个
[1] David Maier,et al. On Finding Minimal Length Superstrings , 1980, J. Comput. Syst. Sci..
[2] D. Atkin. OR scheduling algorithms. , 2000, Anesthesiology.
[3] Esko Ukkonen,et al. A Greedy Approximation Algorithm for Constructing Shortest Common Superstrings , 1988, Theor. Comput. Sci..
[4] Jonathan S. Turner,et al. Approximation Algorithms for the Shortest Common Superstring Problem , 1989, Inf. Comput..
[5] S. M. Johnson,et al. Optimal two- and three-stage production schedules with setup times included , 1954 .
[6] Wojciech Rytter,et al. Parallel and Sequential Approximations of Shortest Superstrings , 1994, SWAT.
[7] R. Gomory,et al. Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem , 1964 .
[8] V. G. Timkovskii. Complexity of common subsequence and supersequence problems and related problems , 1989 .
[9] Martin Middendorf. More on the Complexity of Common Superstring and Supersequence Problems , 1994, Theor. Comput. Sci..