Semantic word cloud representations: Hardness and approximation algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8392 LNCS, Issue , 2014, Pages 514-525

  Barth, Lukas ^a   Fabrikant, Sara Irina ^b   Kobourov, Stephen G ^c   Lubiw, Anna ^d   Nöllenburg, Martin ^a   Okamoto, Yoshio ^e   Pupyrev, Sergey ^c,h   Squarcella, Claudio ^f   Ueckerdt, Torsten ^a   Wolff, Alexander ^g  

^a KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF ZURICH   (Switzerland)

^c University of Arizona   (United States)

^d UNIVERSITY OF WATERLOO   (Canada)

^e UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

^f ROMA TRE UNIVERSITY   (Italy)

^g UNIVERSITY OF WÜRZBURG   (Germany)

^h URAL FEDERAL UNIVERSITY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; DATA MINING; FORESTRY; GEOMETRY; HEURISTIC ALGORITHMS; HEURISTIC METHODS; INFORMATION SCIENCE; PROFITABILITY; SEMANTICS; STARS;

BOUNDED DEGREE; CONSTANT FACTOR APPROXIMATION; GEOMETRIC PROBLEMS; GEOMETRIC REPRESENTATION; OPTIMIZATION PROBLEMS; SEMANTIC RELATIONSHIPS; SEMANTICALLY-RELATED WORDS; STRONGLY NP-HARD;

TREES (MATHEMATICS);

ALGORITHMS; DATA PROCESSING; FORESTRY; INFORMATION RETRIEVAL; PROFITABILITY;

EID: 84899939512     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-54423-1_45     Document Type: Conference Paper

References (24)

1. 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. Arxiv report arxiv.org/abs/1311.4778 (2013)
2. Buchsbaum, A.L., Gansner, E.R., Procopiuc, C.M., Venkatasubramanian, S.: Rectangular layouts and contact graphs. ACM Trans. Algorithms 4(1) (2008)
3. Chekuri, C., Khanna, S.: A polynomial time approximation scheme for the multiple knapsack problem. SIAM J. Comput. 35(3), 713-728 (2005)
4. Collins, C., Viégas, F.B., Wattenberg, M.: Parallel tag clouds to explore and analyze faceted text corpora. In: Proc. IEEE Symp. Vis. Analytics Sci. Tech., pp. 91-98 (2009)
5. Cui, W., Wu, Y., Liu, S., Wei, F., Zhou, M., Qu, H.: Context-preserving dynamic word cloud visualization. IEEE Comput. Graphics Appl. 30(6), 42-53 (2010)
6. Dumais, S.T.: Latent semantic analysis. Annu. Rev. Inform. Sci. Tech. 38(1), 188-230 (2004)
7. Dwyer, T., Marriott, K., Stuckey, P.J.: Fast node overlap removal. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 153-164. Springer, Heidelberg (2006)
8. Eppstein, D., Mumford, E., Speckmann, B., Verbeek, K.: Area-universal and constrained rectangular layouts. SIAM J. Comput. 41(3), 537-564 (2012)
9. Felsner, S.: Rectangle and square representations of planar graphs. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory, pp. 213-248. Springer, Heidelberg (2013)
10. Fleischer, L., Goemans, M.X., Mirrokni, V.S., Sviridenko, M.: Tight approximation algorithms for maximum separable assignment problems. Math. Oper. Res. 36(3), 416-431 (2011)
11. Gansner, E.R., Hu, Y.: Efficient, proximity-preserving node overlap removal. J. Graph Algortihms Appl. 14(1), 53-74 (2010)
12. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NPCompleteness. W. H. Freeman & Co., New York (1979)
13. Hakimi, S.L., Mitchem, J., Schmeichel, E.F.: Star arboricity of graphs. Discrete Math. 149(1-3), 93-98 (1996)
14. Koh, K., Lee, B., Kim, B.H., Seo, J.: Maniwordle: Providing flexible control over Wordle. IEEE Trans. Vis. Comput. Graph. 16(6), 1190-1197 (2010)
15. Lagus, K., Honkela, T., Kaski, S., Kohonen, T.: Self-organizing maps of document collections: A new approach to interactive exploration. In: Simoudis, E., Han, J., Fayyad, U.M. (eds.) KDD 1996, pp. 238-243. AAAI Press (1996)
16. Leung, J.Y.T., Tam, T.W., Wong, C., Young, G.H., Chin, F.Y.: Packing squares into a square. J. Parallel Distrib. Comput. 10(3), 271-275 (1990)
17. Nguyen, C.T., Shen, J., Hou, M., Sheng, L., Miller, W., Zhang, L.: Approximating the spanning star forest problem and its application to genomic sequence alignment. SIAM J. Comput. 38(3), 946-962 (2008)
18. Nocaj, A., Brandes, U.: Organizing search results with a reference map. IEEE Trans. Vis. Comput. Graphics 18(12), 2546-2555 (2012)
19. Nöllenburg, M., Prutkin, R., Rutter, I.: Edge-weighted contact representations of planar graphs. J. Graph Algorithms Appl. 17(4), 441-473 (2013)
20. Petersen, J.: Die Theorie der regulären Graphen. Acta Mathematica 15(1), 193-220 (1891)
21. Raisz, E.: The rectangular statistical cartogram. Geogr. Review 24(3), 292-296 (1934)
22. Thomassen, C.: Interval representations of planar graphs. J. Combin. Theory, Ser. B 40(1), 9-20 (1986)
23. Viégas, F.B., Wattenberg, M., Feinberg, J.: Participatory visualization with Wordle. IEEE Trans. Vis. Comput. Graphics 15(6), 1137-1144 (2009)
24. Wu, Y., Provan, T., Wei, F., Liu, S., Ma, K.L.: Semantic-preserving word clouds by seam carving. Comput. Graphics Forum 30(3), 741-750 (2011)