Automata, Languages and Programming

DOI10.1007/b99859zbMath1098.05504OpenAlexW2505584480MaRDI QIDQ5466482

Guo Jun Li, Xiaotie Deng

Publication date: 24 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b99859

zbMATH Keywords

polynomial-time approximation schemecomputer applicationminimum congestion embedding hypergraph in a cycle

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (3)

On packing and coloring hyperedges in a cycle ⋮ A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring ⋮ A polynomial time approximation scheme for embedding a directed hypergraph on a ring

This page was built for publication: Automata, Languages and Programming