Improved approximation algorithms for box contact representations

DOI10.1007/s00453-016-0121-3zbMath1364.68366arXiv1403.4861OpenAlexW94833765MaRDI QIDQ521820

Joachim Spoerhase, Thomas C. van Dijk, Martin Fink, Michael A. Bekos, Sergey Pupyrev, Philipp Kindermann, Alexander Wolff, Stephen G. Kobourov

Publication date: 12 April 2017

Published in: Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

approximation algorithmsbox contact representationsword clouds

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items

Layered area-proportional rectangle contact representations

Cites Work

• Unnamed Item
• Unnamed Item
• A note on 1-planar graphs
• An efficient approximation for the generalized assignment problem
• Lower bounds on the cardinality of the maximum matchings of planar graphs
• Star arboricity of graphs
• Edge-weighted contact representations of planar graphs
• Rectangle and Square Representations of Planar Graphs
• Tight Approximation Algorithms for Maximum Separable Assignment Problems
• Area-Universal and Constrained Rectangular Layouts
• Approximation Techniques for Utilitarian Mechanism Design
• Efficient, Proximity-Preserving Node Overlap Removal
• Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
• Rectangular layouts and contact graphs
• Semantic Word Cloud Representations: Hardness and Approximation Algorithms
• Decomposition of Finite Graphs Into Forests
• Graph Drawing