A PTAS for embedding hypergraph in a cycle (extended abstract)
From MaRDI portal
Recommendations
- A polynomial-time approximation scheme for embedding hypergraph 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 weighted cycle
- High Performance Computing - HiPC 2003
- Improved approximation algorithms for embedding hyperedges in a cycle
- Graph Drawing
- Embedding of cycles in arrangement graphs
- Extension of paths and cycles for hypergraphs
- Improved Approximation Algorithms for Weighted Hypergraph Embedding in a Cycle
Cited in
(9)- A polynomial time approximation scheme for embedding a directed hypergraph on a ring
- A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring
- On packing and coloring hyperedges in a cycle
- The cycle embedding problem
- Improved approximation algorithms for embedding hyperedges in a cycle
- A polynomial time approximation scheme for embedding hypergraph in a weighted cycle
- Embedding hypergraph in trees of rings
- A polynomial-time approximation scheme for embedding hypergraph in a cycle
- A polynomial time approximation scheme for embedding hypergraph in a weighted cycle
This page was built for publication: A PTAS for embedding hypergraph in a cycle (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5466482)