Semantic Word Cloud Representations: Hardness and Approximation Algorithms

DOI10.1007/978-3-642-54423-1_45zbMath1405.68236arXiv1311.4778OpenAlexW2153113544WikidataQ124084530 ScholiaQ124084530MaRDI QIDQ5405069

Sergey Pupyrev, Martin Nöllenburg, Anna Lubiw, Sara Irina Fabrikant, Yoshio Okamoto, Alexander Wolff, Stephen G. Kobourov, Lukas Barth, Torsten Ueckerdt, Claudio Squarcella

Publication date: 31 March 2014

Published in: LATIN 2014: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1311.4778

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items

Layered area-proportional rectangle contact representations, Improved approximation algorithms for box contact representations