1. Adelson-Velsky, G.M., Levner, E.: Project scheduling in AND/OR graphs: A generalization of Dijkstra’s algorithm. Technical report, Department of Computer Science, Holon Academic Institute of Technology, Holon, Israel (1999)
2. Chekuri, C., Motwani, R.: Precedence constrained scheduling to minimize sum of weighted completion times on a single machine. Discrete Applied Mathematics 98, 29–38 (1999)
3. Chudak, F., Hochbaum, D.S.: A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine. Operations Research Letters 25, 199–204 (1999)
4. Dinur, I., Safra, S.: On the hardness of approximating label-cover. Electronic Colloquium on Computational Complexity (ECCC) Technical Report TR99-015, School of Mathematical Sciences, Tel Aviv University (1999)
5. Garey, M.J., Johnson, D.S.: Computers and Intractibility: A Guide to the Theory of NP Completeness. Freemann, New York (1979)