Ordering Problems Approximated: Single-Processor Scheduling and Interval Graph Completion
暂无分享,去创建一个
[1] W. A. Horn. Single-Machine Job Sequencing with Treelike Precedence Ordering and Linear Delay Penalties , 1972 .
[2] R. Ravi,et al. Approximation through multicommodity flow , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[4] E. Lawler. Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints , 1978 .
[5] C. P. Rangan,et al. A Unified Approach to Domination Problems on Interval Graphs , 1988, Inf. Process. Lett..
[6] Frank Thomson Leighton,et al. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[7] William L. Maxwell,et al. Theory of scheduling , 1967 .
[8] David S. Johnson,et al. Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..
[9] Fillia Makedon,et al. Fast approximation algorithms for multicommodity flow problems , 1991, STOC '91.
[10] D. Adolphson. Optimal linear-ordering. , 1973 .
[11] D. Kendall. Incidence matrices, interval graphs and seriation in archeology. , 1969 .
[12] Mark D. Hansen. Approximation algorithms for geometric embeddings in the plane with applications to parallel processing problems , 1989, 30th Annual Symposium on Foundations of Computer Science.