Improved approximation algorithms for embedding hyperedges in a cycle
DOI10.1016/S0020-0190(98)00117-3zbMATH Open1339.68317MaRDI QIDQ293373FDOQ293373
Authors: Teofilo F. Gonzalez 
Publication date: 9 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001173?np=y
Recommendations
- High Performance Computing - HiPC 2003
- A polynomial-time approximation scheme for embedding hypergraph in a cycle
- Automata, Languages and Programming
- A 2-approximation algorithm for an embedded hypergraph in a weighted cycle
- Improved Approximation Algorithms for Weighted Hypergraph Embedding in a Cycle
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)
Cites Work
Cited In (7)
- Automata, Languages and Programming
- On packing and coloring hyperedges in a cycle
- Cycle Killer...Qu'est-ce que c'est? On the Comparative Approximability of Hybridization Number and Directed Feedback Vertex Set
- On minimizing the maximum congestion for weighted hypergraph embedding in a cycle
- High Performance Computing - HiPC 2003
- 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
This page was built for publication: Improved approximation algorithms for embedding hyperedges in a cycle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293373)
