๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Improved Approximation Algorithms for Weighted Hypergraph Embedding in a Cycle

โœ Scribed by Ho, Hann-Jang; Lee, SingLing

Book ID
118203438
Publisher
Society for Industrial and Applied Mathematics
Year
2008
Tongue
English
Weight
197 KB
Volume
18
Category
Article
ISSN
1052-6234

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On minimizing the maximum congestion for
On minimizing the maximum congestion for Weighted Hypergraph Embedding in a Cycle
โœ SingLing Lee; Hann-Jang Ho ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 77 KB

The problem of Weighted Hypergraph Embedding in a Cycle (WHEC) is to embed the weighted hyperedges of a hypergraph as adjacent paths around a cycle, such that the maximum congestion over any physical link in the cycle is minimized. In this paper, we first show that even when hyperedges contain exact