On minimizing the maximum congestion for weighted hypergraph embedding in a cycle
From MaRDI portal
Recommendations
- Improved Approximation Algorithms for Weighted Hypergraph Embedding in a Cycle
- A 2-approximation algorithm for an embedded hypergraph in a weighted cycle
- A polynomial time approximation scheme for embedding hypergraph in a weighted cycle
- High Performance Computing - HiPC 2003
- A polynomial-time approximation scheme for embedding hypergraph in a cycle
Cites work
Cited in
(6)- A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring
- On packing and coloring hyperedges in a cycle
- Improved Approximation Algorithms for Weighted Hypergraph Embedding in a Cycle
- A polynomial time approximation scheme for embedding hypergraph in a weighted cycle
- High Performance Computing - HiPC 2003
- A 2-approximation algorithm for an embedded hypergraph in a weighted cycle
This page was built for publication: On minimizing the maximum congestion for weighted hypergraph embedding in a cycle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1014437)