A tighter insertion-based approximation of the crossing number
A tighter insertion-based approximation of the crossing number
复制标题
交叉数的更紧密的基于插入的近似
DOI:
10.1007/s10878-016-0030-z
复制
发表时间:
2017
影响因子:
1
通讯作者:
P. Hlinĕný
中科院分区:
文献类型:
--
作者:
M. Chimani;P. Hlinĕný
LetGbe a planar graph andFa set of additional edges not yet inG. Themultiple edge insertionproblem (MEI) asks for a drawing ofwith the minimum number of pairwise edge crossings, such that the subdrawing ofGis plane. Finding an exact solution to MEI is NP-hard for generalF. We present the first polynomial time algorithm for MEI that achieves an additive approximation guarantee—depending only on the size ofFand the maximum degree ofG, in the case of connectedG. Our algorithm seems to be the first directly implementable one in that realm, too, next to the single edge insertion. It is also known that an (even approximate) solution to the MEI problem would approximate the crossing number of theF-almost-planar graph, while computing the crossing number ofexactly is NP-hard already when. Hence our algorithm induces new, improved approximation bounds for the crossing number problem ofF-almost-planar graphs, achieving constant-factor approximation for the large class of such graphs of bounded degrees and bounded size ofF.
登录
查看更多内容
DOI:
10.1007/978-3-540-24595-7_2
发表时间:
2003-09
期刊:
--
影响因子:
--
作者:
Carsten Gutwenger;Petra Mutzel
通讯作者:
Carsten Gutwenger;Petra Mutzel
DOI:
10.17877/de290r-15654
发表时间:
2010
期刊:
J. Graph Algorithms Appl.
影响因子:
--
作者:
Carsten Gutwenger
通讯作者:
Carsten Gutwenger
DOI:
10.1109/12.46286
发表时间:
1990
期刊:
IEEE Trans. Computers
影响因子:
--
作者:
S. Masuda;K. Nakajima;T. Kashiwabara;T. Fujisawa
通讯作者:
T. Fujisawa
DOI:
10.1016/j.endm.2007.07.037
发表时间:
2007
期刊:
Electron. Notes Discret. Math.
影响因子:
--
作者:
I. Gitler;Petr Hliněný;J. Leaños;G. Salazar
通讯作者:
G. Salazar
DOI:
10.1137/120872310
发表时间:
2012-03
期刊:
ArXiv
影响因子:
--
作者:
Sergio Cabello;B. Mohar
通讯作者:
Sergio Cabello;B. Mohar