On minimizing the maximum congestion for weighted hypergraph embedding in a cycle
From MaRDI portal
Publication:1014437
DOI10.1016/S0020-0190(03)00297-7zbMath1161.68681MaRDI QIDQ1014437
Publication date: 28 April 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Related Items
On packing and coloring hyperedges in a cycle, A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring
Cites Work