.png){kind=icon}
Return
Efficient algorithms for minimum congestion hypergraph embedding in a cycle
.png){kind=icon}
PRE
AI
DOI：10.1109/TPDS.2006.34.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The Minimum Congestion Hypergraph Embedding in a Cycle (MCHEC) problem is to embed the hyperedges of a hypergraph as paths in a cycle with the same node set such that the maximum congestion (the maximum number of paths that use any single edge in the cycle) is minimized. The MCHEC problem has many applications, including optimizing communication congestions in computer networks and parallel computing. The problem is NP-hard. In this paper, we give a 1.8-approximation algorithm for the MCHEC problem. This improves the previous 2-approximation results. Our algorithm has the optimal time complexity O(mn) for a hypergraph with m hyperedges and n nodes. We also propose an algorithm which finds an embedding with the optimal congestion L* for the MCHEC problem in O(n(nL*)(L*)) time. This improves the previous O((mn)(L*+1)) time algorithm.
Keywords:
hypergraph embedding
approximation algorithms
communication on rings
edge congestion minimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
5.2K
Citations:
1.1W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveTGA-DTA, infrared and x-ray powder diffraction studies on strontium nitroprusside and its hydrates
PREAI
ShareSaveEffects of composition and processing on properties of modified maghemite for high-density recording
PREAI
ShareSaveShareSave
View more