1. Angelopoulos, S., Borodin, A.: The power of priority algorithms for facility location and set cover. Algorithmica 40(4), 271–291 (2004)
2. Alekhnovich, M., Borodin, A., Buresh-Oppenheim, J., Impagliazzo, R., Magen, A., Pitassi, T.: Toward a model for backtracking and dynamic programming. In: IEEE Conference on Computational Complexity, pp. 308–322 (2005)
3. Arkin, E.M., Silverberg, E.L.: Scheduling jobs with fixed start and end times. Discrete Appl. Math. 18, 1–8 (1987)
4. Arora, S., Bollobás, B., Lovász, L.: Proving integrality gaps without knowing the linear program. In: FOCS, pp. 313–322 (2002)
5. Arora, S., Bollobás, B., Lovász, L., Tourlakis, I.: Proving integrality gaps without knowing the linear program. Theory Comput. 2(1), 19–51 (2006)