Ordering Problems Approximated: Single-Processor Scheduling and Interval Graph Completion

R. Ravi, Ajit Agrawal, Philip N. Klein. Ordering Problems Approximated: Single-Processor Scheduling and Interval Graph Completion. In Javier Leach Albert, Burkhard Monien, Mario Rodríguez-Artalejo, editors, Automata, Languages and Programming, 18th International Colloquium, ICALP91, Madrid, Spain, July 8-12, 1991, Proceedings. Volume 510 of Lecture Notes in Computer Science, pages 751-762, Springer, 1991.

Abstract

Abstract is missing.