| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 437405 | Theoretical Computer Science | 2011 | 8 Pages |
Abstract
The problem of Minimum Congestion Hypergraph Embedding in a Weighted Cycle (MCHEWC) is to embed the hyperedges of a hypergraph as paths in a weighted cycle such that the maximum congestion is minimized. This problem is NP-hard. In this paper, we present a polynomial time approximation scheme (PTAS) for this problem.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
