Publisher
Springer International Publishing
Reference14 articles.
1. Ambühl, C., Mastrolilli, M., Svensson, O.: Inapproximability results for maximum edge biclique, minimum linear arrangement, and sparsest cut. SIAM J. Comput. 40, 567–596 (2011)
2. Arora, S., Frieze, A., Kaplan, H.: A new rounding procedure for the assignment problem with applications to dense graphs arrangements. Math. Progr. 92, 1–36 (2002)
3. Bhasker, J., Sahni, S.: Optimal linear arrangement of circuit components. In: HICSS 1987, vol. 2, pp. 99–111 (1987)
4. Boysen, N., Stephan, K.: The deterministic product location problem under a pick-by-order policy. Discr. Appl. Math. 161, 2862–2875 (2013)
5. Lecture Notes in Computer Science;J Cohen,2006