论文信息 - Relocation problems are hard

Relocation problems are hard

We show that General Relocation is NP-Complete. However, specific Relocation subprobiems, such as relocation feasibility or Johnson's scheduling problem are shown to be of almost linear complexity.

Edward H. Kaplan | Aimhood Amir

[1] Edward H. Kaplan. Relocation Models for Public Housing Redevelopment Programs , 1986 .

[2] Jeffrey D. Ullman,et al. Principles of Database Systems , 1980 .

[3] Raymond E. Miller,et al. Complexity of Computer Computations , 1972 .

[4] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .