Improved Approximation Algorithms for Box Contact Representations
- 178 Downloads
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.
KeywordsWord clouds Box contact representations Approximation algorithms
We thank the anonymous reviewers for helping us to improve the presentation of our paper. We particularly thank the reviewer who contributed the idea to derandomize our algorithms for the general weighted case using Theorem 4.
- 3.Barth, L., Fabrikant, S.I., Kobourov, S., Lubiw, A., Nöllenburg, M., Okamoto, Y., Pupyrev, S., Squarcella, C., Ueckerdt, T., Wolff, A.: Semantic word cloud representations: hardness and approximation algorithms. In: Pardo, A., Viola, A. (eds) Proceedings of 11th Latin American Symposium Theoritical Information (LATIN’14), vol 8392 of Lecture Notes in Computer Science, pp 514–525. Springer, Heidelberg (2014)Google Scholar
- 4.Barth, L., Kobourov, S., Pupyrev, S.: Experimental comparison of semantic word clouds. In: Gudmundsson, J., Katajainen, J. (eds) Proceedings of 13th International Symposium on Experimental Algorithms (SEA’14), vol 8504 of Lecture Notes in Computer Science, pp 247–258. Springer, Heidelberg (2014)Google Scholar
- 6.Buchsbaum, A.L., Gansner, E.R., Procopiuc, C.M., Venkatasubramanian, S.: Rectangular layouts and contact graphs. ACM Trans. Algorithms 4(1) (2008)Google Scholar
- 7.Chekuri, C., Khanna, S.: A PTAS for the multiple knapsack problem. In: Proceedings of 11th Annual ACM-SIAM Symposum Discrete Algorithms (SODA’00), pp 213–222. SIAM (2000)Google Scholar
- 10.Dwyer, T., Marriott, K., Stuckey, P.J.: Fast node overlap removal. In: Healy, P., Nikolov, N.S. (eds), Proc. 13th International Symposium on Graph Drawing (GD’05), vol 3843 of Lecture Notes in Computer Science, pp. 153–164. Springer, Heidelberg (2005)Google Scholar
- 12.Erkan, G., Radev, D.R.: Lexrank: graph-based lexical centrality as salience in text summarization. J. Artif. Int. Res. 22(1), 457–479 (2004)Google Scholar
- 18.Li, H.: Word clustering and disambiguation based on co-occurrence data. J. Nat. Lang. Eng. 8(1), 25–42 (2002)Google Scholar
- 25.Weiland, S.: Der Koalitionsvertrag im Schnellcheck (Quick overview of the [German] coalition agreement). Spiegel Online, www.spiegel.de/politik/deutschland/was-der-koalitionsvertrag-deutschland-bringt-a-935856.html Click on “Fotos”, 27 Nov. 2013