Improved Approximation Algorithms for Box Contact Representations

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.

[1]  E. Raisz.  The Rectangular Statistical Cartogram , 1934 .

[2]  Alexander Wolff,et al.  Improved Approximation Algorithms for Box Contact Representations , 2014, ESA.

[3]  Martin Wattenberg,et al.  Participatory Visualization with Wordle , 2009, IEEE Transactions on Visualization and Computer Graphics.

[4]  Rosane Minghim,et al.  Semantic Wordification of Document Collections , 2012, Comput. Graph. Forum.

[5]  Dragomir R. Radev,et al.  LexRank: Graph-based Lexical Centrality as Salience in Text Summarization , 2004, J. Artif. Intell. Res..

[6]  Eyal Ackerman.  A note on 1-planar graphs , 2014, Discret. Appl. Math..

[7]  Sanjeev Khanna,et al.  A PTAS for the multiple knapsack problem , 2000, SODA '00.

[8]  Stephen G. Kobourov,et al.  Experimental Comparison of Semantic Word Clouds , 2014, SEA.

[9]  Alexander Wolff,et al.  Semantic Word Cloud Representations: Hardness and Approximation Algorithms , 2013, LATIN.

[10]  Reuven Cohen,et al.  An efficient approximation for the Generalized Assignment Problem , 2006, Inf. Process. Lett..

[11]  S. Louis Hakimi,et al.  Star arboricity of graphs , 1996, Discret. Math..

[12]  Takao Nishizeki,et al.  Lower bounds on the cardinality of the maximum matchings of planar graphs , 1979, Discret. Math..

[13]  Peter J. Stuckey,et al.  Fast Node Overlap Removal , 2005, GD.

[14]  Suresh Venkatasubramanian,et al.  Rectangular layouts and contact graphs , 2006, TALG.

[15]  C. Nash-Williams.  Decomposition of Finite Graphs Into Forests , 1964 .

[16]  Bongshin Lee,et al.  ManiWordle: Providing Flexible Control over Wordle , 2010, IEEE Transactions on Visualization and Computer Graphics.

[17]  Martin Nöllenburg,et al.  Edge-Weighted Contact Representations of Planar Graphs , 2012, Graph Drawing.

[18]  Hang Li,et al.  Word Clustering and Disambiguation Based on Co-occurrence Data , 1998, COLING.

[19]  Furu Wei,et al.  Context preserving dynamic word cloud visualization , 2010, 2010 IEEE Pacific Visualization Symposium (PacificVis).

[20]  Bettina Speckmann,et al.  Area-Universal and Constrained Rectangular Layouts , 2012, SIAM J. Comput..

[21]  Berthold Vöcking,et al.  Approximation techniques for utilitarian mechanism design , 2005, STOC '05.

[22]  Kwan-Liu Ma,et al.  Semantic‐Preserving Word Clouds by Seam Carving , 2011, Comput. Graph. Forum.

[23]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[24]  Yifan Hu,et al.  Efficient, Proximity-Preserving Node Overlap Removal , 2010, J. Graph Algorithms Appl..

[25]  Stefan Felsner,et al.  Rectangle and Square Representations of Planar Graphs , 2013 .

[26]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[27]  Greg N. Frederickson,et al.  Fast Algorithms for Shortest Paths in Planar Graphs, with Applications , 1987, SIAM J. Comput..