Approximation techniques for hypergraph partitioning problems
type: Item
instance of: scholarly article
title: Approximation techniques for hypergraph partitioning problems
zbMATH Open document ID: 0824.05048
DOI: 10.1016/0166-218X(93)E0166-V
author: Scott W. Hadley
published in: Discrete Applied Mathematics
publication date: 1995-10-26T00:00:00Z
review text: The paper discusses techniques for approximating a hypergraph by a weighted graph. This has potential applications in node partitioning algorithms. The approximations are compared with other known approximations and according to the author yield promising results.
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 761078
zbMATH Keywords: hypergraph partitioning
zbMATH Keywords: hypergraph
zbMATH Keywords: weighted graph
zbMATH Keywords: node partitioning algorithms
zbMATH Keywords: approximations
reviewed by: Vladimir D. Tonchev
MaRDI profile type: Publication
cites work: An Algorithm for Partitioning the Nodes of a Graph
cites work: Q3680754
cites work: Q5595579
cites work: Design of generalized double rank and multiple rank sequential circuits
cites work: Q4198056
cites work: A parallel graph partitioning algorithm for a message-passing multiprocessor
cites work: Q3669422
cites work: Partitioning Sparse Matrices with Eigenvectors of Graphs
cites work: A projection technique for partitioning the nodes of a graph
cites work: A Gomory-Hu cut tree representation of a netlist partitioning problem
cites work: A method for finding minimal bottle-neck cells for grouping part-machine families†
description: scientific article; zbMATH DE number 761078