Abstract
AbstractWe consider the problem of embedding hyperedges of a hypergraph as paths in a cycle such that the maximum congestion–the maximum number of paths that use any single edge in a cycle–is minimized. We settle the problem with a polynomial-time approximation scheme.KeywordsMinimum congestion embedding hypergraph in a cyclecomputer applicationpolynomial-time approximation scheme
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have