Ordering problems approximated: single-processor scheduling and interval graph completion

This publication has 10 references indexed in Scilit:

• Approximation through multicommodity flow
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Some simplified NP-complete graph problems
  Published by Elsevier ,2002
• Fast approximation algorithms for multicommodity flow problems
  Published by Association for Computing Machinery (ACM) ,1991
• Approximation algorithms for geometric embeddings in the plane with applications to parallel processing problems
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1989
• A unified approach to domination problems on interval graphs
  Information Processing Letters, 1988
• An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1988
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
  Published by Elsevier ,1978
• Optimal Linear Ordering
  SIAM Journal on Applied Mathematics, 1973
• Single-Machine Job Sequencing with Treelike Precedence Ordering and Linear Delay Penalties
  SIAM Journal on Applied Mathematics, 1972
• Incidence matrices, interval graphs and seriation in archeology
  Pacific Journal of Mathematics, 1969