Author:
Caprara Alberto,Letchford Adam N.,Salazar-González Juan-José
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference23 articles.
1. C. Ambühl, M. Mastrolilli & Ola Svensson (2007) Inapproximability results for sparsest cut, optimal linear arrangement, and precedence constrained scheduling. Proc. of the 48th Annual IEEE Symposium on Foundations of Computer Science, pp. 329–337
2. Flow metrics;Bornstein;Theor. Comp. Sci,2004
3. Laying out sparse graphs with provably minimum bandwidth;Caprara;INFORMS J. Comp.,2005
4. A. Caprara, M. Jung, M. Oswald, G. Reinelt, E. Traversi (2009) A betweenness approach for solving the linear arrangement problem. Working paper.
5. M. Charikar, M.T. Hajiaghayi, H. Karloff & S. Rao (2006) l22 spreading metrics for vertex ordering problems. In Proc. of the 17th annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1018–1027 (Journal version submitted to Algorithmica).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献