A polynomial-time approximation scheme for embedding hypergraph in a cycle

DOI10.1145/1497290.1497296zbMath1445.68352OpenAlexW2058787824MaRDI QIDQ4962786

Guo Jun Li, Ying Xu, Xiaotie Deng

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1497290.1497296

zbMATH Keywords

NP-hardnesspolynomial-time approximation schemehypergraph embeddingminimum congestion

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Hypergraphs (05C65) Approximation algorithms (68W25)

Related Items (2)

A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring ⋮ A polynomial time approximation scheme for embedding hypergraph in a weighted cycle

This page was built for publication: A polynomial-time approximation scheme for embedding hypergraph in a cycle