Author:
Andersson Mattias,Gudmundsson Joachim,Levcopoulos Christos
Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. Ahuja, R.K., Goldberg, A.V., Orlin, J.B., Tarjan, R.E.: Finding minimum-cost flows by double scaling. Tech. rep. CS-TR-164-88. Department of computer science. Princeton University, Princeton, NJ (1988)
2. Anderson, R.J., Sobti, S.: The Table Layout Problem. In: proceedings of Symposium on Computational Geometry, pp. 115–123 (1999)
3. Beach, R.J.: Setting tables and illustrations with style. PhD thesis, Dept. of computer science, University of Waterloo, Canada (1985)
4. Garey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the theory of NP-completeness. W. H. Freeman and Company, San Francisco (1979)
5. Goldberg, A.V., Rao, S.: Beyond the flow decomposition barrier. Journal of the ACM 45(5), 783–797 (1998)