A 2-approximation algorithm for an embedded hypergraph in a weighted cycle

MaRDI QIDQ5320444zbMATH OpenFDO

Authors Zhaoxia Yang

Publication date 22 July 2009

zbMATH Keywords

approximation algorithmhypergraph embeddingminimum congestionweighted cycle

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• On minimizing the maximum congestion for weighted hypergraph embedding 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
• A polynomial-time approximation scheme for embedding hypergraph in a cycle
• A polynomial time approximation scheme for embedding hypergraph in a weighted cycle

Cited in

(4)

• On minimizing the maximum congestion for weighted hypergraph embedding in a cycle
• A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring
• Improved approximation algorithms for embedding hyperedges in a cycle
• Improved Approximation Algorithms for Weighted Hypergraph Embedding in a Cycle

This page was built for publication: A 2-approximation algorithm for an embedded hypergraph in a weighted cycle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5320444)