A polynomial time approximation scheme for embedding a directed hypergraph on a ring

DOI10.1016/j.ipl.2005.10.008zbMath1184.68642OpenAlexW2113737747MaRDI QIDQ1045935

Kang Li, Lusheng Wang

Publication date: 18 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.10.008

zbMATH Keywords

ringsapproximation algorithmsdirected hyperedges embedding

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (9)

Circulant tensors with applications to spectral hypergraph theory and stochastic process ⋮ A general result on the spectral radii of nonnegative \(k\)-uniform tensors ⋮ A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring ⋮ Sharp bounds for the spectral radii of nonnegative tensors ⋮ On spectral theory of a k-uniform directed hypergraph ⋮ Computing the largest H-eigenvalue of large-scale tensors generated from directed hypergraphs ⋮ Sharp bounds for spectral radius of nonnegative weakly irreducible tensors ⋮ Spectral directed hypergraph theory via tensors ⋮ A sharp upper bound on the spectral radius of a nonnegative \(k\)-uniform tensor and its applications to (directed) hypergraphs

Cites Work

• Unnamed Item
• Improved approximation algorithms for embedding hyperedges in a cycle
• Algorithms for routing around a rectangle
• On the closest string and substring problems
• High Performance Computing - HiPC 2003
• Automata, Languages and Programming

This page was built for publication: A polynomial time approximation scheme for embedding a directed hypergraph on a ring