%0 Journal Article %1 Bekos2016 %A Bekos, Michael A. %A Dijk, Thomas C. %A Fink, Martin %A Kindermann, Philipp %A Kobourov, Stephen %A Pupyrev, Sergey %A Spoerhase, Joachim %A Wolff, Alexander %D 2016 %J Algorithmica %K myown %P 1--19 %R 10.1007/s00453-016-0121-3 %T Improved Approximation Algorithms for Box Contact Representations %U http://dx.doi.org/10.1007/s00453-016-0121-3 %X We study the following geometric representation problem: Given a graph whose vertices correspond to axis-aligned rectangles with fixed dimensions, arrange the rectangles without overlaps in the plane such that two rectangles touch if the graph contains an edge between them. This problem is called Contact Representation of Word Networks (Crown) since it formalizes the geometric problem behind drawing word clouds in which semantically related words are close to each other. Crown is known to be NP-hard, and there are approximation algorithms for certain graph classes for the optimization version, Max-Crown, in which realizing each desired adjacency yields a certain profit. We present the first O(1)-approximation algorithm for the general case, when the input is a complete weighted graph, and for the bipartite case. Since the subgraph of realized adjacencies is necessarily planar, we also consider several planar graph classes (namely stars, trees, outerplanar, and planar graphs), improving upon the known results. For some graph classes, we also describe improvements in the unweighted case, where each adjacency yields the same profit. Finally, we show that the problem is APX-complete on bipartite graphs of bounded maximum degree.

@article{Bekos2016, abstract = {We study the following geometric representation problem: Given a graph whose vertices correspond to axis-aligned rectangles with fixed dimensions, arrange the rectangles without overlaps in the plane such that two rectangles touch if the graph contains an edge between them. This problem is called Contact Representation of Word Networks (Crown) since it formalizes the geometric problem behind drawing word clouds in which semantically related words are close to each other. Crown is known to be NP-hard, and there are approximation algorithms for certain graph classes for the optimization version, Max-Crown, in which realizing each desired adjacency yields a certain profit. We present the first O(1)-approximation algorithm for the general case, when the input is a complete weighted graph, and for the bipartite case. Since the subgraph of realized adjacencies is necessarily planar, we also consider several planar graph classes (namely stars, trees, outerplanar, and planar graphs), improving upon the known results. For some graph classes, we also describe improvements in the unweighted case, where each adjacency yields the same profit. Finally, we show that the problem is APX-complete on bipartite graphs of bounded maximum degree.}, added-at = {2016-03-23T01:50:28.000+0100}, author = {Bekos, Michael A. and Dijk, Thomas C. and Fink, Martin and Kindermann, Philipp and Kobourov, Stephen and Pupyrev, Sergey and Spoerhase, Joachim and Wolff, Alexander}, biburl = {https://www.bibsonomy.org/bibtex/237c432581bfb79f9b0f0b31593a5096e/fink}, doi = {10.1007/s00453-016-0121-3}, interhash = {41837477279a8b12a1860b3bc496e241}, intrahash = {37c432581bfb79f9b0f0b31593a5096e}, issn = {1432-0541}, journal = {Algorithmica}, keywords = {myown}, pages = {1--19}, timestamp = {2016-03-23T01:50:28.000+0100}, title = {Improved Approximation Algorithms for Box Contact Representations}, url = {http://dx.doi.org/10.1007/s00453-016-0121-3}, year = 2016 }