Improved approximation algorithms for box contact representations
type: Item
instance of: scholarly article
title: Improved approximation algorithms for box contact representations
zbMATH Open document ID: 1364.68366
author: Michael A. Bekos
author: Thomas C. van Dijk
author: Martin Fink
author: Philipp Kindermann
author: Sergey Pupyrev
author: Joachim Spoerhase
author: Alexander Wolff
author: Stephen G. Kobourov
published in: Algorithmica
publication date: 2017-04-12T00:00:00Z
full work available at URL: https://arxiv.org/abs/1403.4861
full work available at URL: http://hdl.handle.net/10150/623076
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 6705196
zbMATH Keywords: word clouds
zbMATH Keywords: box contact representations
zbMATH Keywords: approximation algorithms
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W94833765
arXiv ID: 1403.4861
cites work: A note on 1-planar graphs
cites work: Q4004078
cites work: Semantic Word Cloud Representations: Hardness and Approximation Algorithms
cites work: Approximation Techniques for Utilitarian Mechanism Design
cites work: Rectangular layouts and contact graphs
cites work: Q4952619
cites work: An efficient approximation for the generalized assignment problem
cites work: Graph Drawing
cites work: Area-universal and constrained rectangular layouts
cites work: Rectangle and Square Representations of Planar Graphs
cites work: Tight approximation algorithms for maximum separable assignment problems
cites work: Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
cites work: Efficient, Proximity-Preserving Node Overlap Removal
cites work: Star arboricity of graphs
cites work: Decomposition of Finite Graphs Into Forests
cites work: Lower bounds on the cardinality of the maximum matchings of planar graphs
cites work: Edge-weighted contact representations of planar graphs
DOI: 10.1007/S00453-016-0121-3
Recommended article: Improved Approximation Algorithms for Box Contact Representations
Recommended article: Scalable algorithms for contact problems
Recommended article: Scalable Algorithms for Contact Problems
Recommended article: Sublinear approximation algorithms for boxicity and related problems
Recommended article: Polynomial Time and Parameterized Approximation Algorithms for Boxicity
Recommended article: A contact searching algorithm for general contact problems
Recommended article: Parameterized Algorithms for Boxicity
Recommended article: Approximation hardness of optimization problems in intersection graphs of \(d\)-dimensional boxes
Recommended article: Q4234073
Recommended article: Linear-time algorithms for hole-free rectilinear proportional contact graph representations
description: scientific article