Minimizing diameters of edges in layout of a hypergraph into a d-dimensional grid

Minimizing diameters of edges in layout of a hypergraph into a d-dimensional grid

0.00 Avg rating—0 Votes
Article ID: iaor20061798
Country: Belarus
Volume: 4
Start Page Number: 59
End Page Number: 64
Publication Date: Dec 2005
Journal: Proceedings of the National Academy of Sciences of Belarus, Series of Physical-Mathematical Sciences
Authors:
Abstract:

The hypergraph layout problem is considered. The hypergraph vertices are placed on a d-dimensional grid. Problem consists of the minimization of the total diameter of the hyperedges. The diameter of a hyperedge is the maximum distance between two vertices of the hyperedge. Approximation algorithm O((log n)2+2/d) for this problem is obtained.

Reviews

Required fields are marked *. Your email address will not be published.