Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference17 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(2), 567–596 (2011)
2. Ausiello, G., Protasi, M., Marchetti-Spaccamela, A., Gambosi, G., Crescenzi, P., Kann, V.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Berlin (1999)
3. Bokal, D., Fijavž, G., Mohar, B.: The minor crossing number. SIAM J. Discrete Math. 20(2), 344–356 (2006)
4. Cabello, S., Mohar, B.: Adding one edge to planar graphs makes crossing number hard. In: Proc. SoCG 2010, pp. 68–76 (2010). See http://arxiv.org/abs/1203.5944 for the full version
5. Chopra, S., Rao, M.R.: On the multiway cut polyhedron. Networks 21(1), 51–89 (1991)
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Minimizing an Uncrossed Collection of Drawings;Lecture Notes in Computer Science;2023
2. Parameterized analysis and crossing minimization problems;Computer Science Review;2022-08
3. A subpolynomial approximation algorithm for graph crossing number in low-degree graphs;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09
4. Towards Better Approximation of Graph Crossing Number;2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS);2020-11
5. Crossing minimization in perturbed drawings;Journal of Combinatorial Optimization;2020-06-12