Semantic Word Cloud Representations: Hardness and Approximation
Algorithms
Semantic Word Cloud Representations: Hardness and Approximation
Algorithms
We study a geometric representation problem, where we are given a set $\cal R$ of axis-aligned rectangles with fixed dimensions and a graph with vertex set $\cal R$. The task is to place the rectangles without overlap such that two rectangles touch if and only if the graph contains an …