On packing and coloring hyperedges in a cycle
From MaRDI portal
Publication:2384398
DOI10.1016/j.dam.2007.05.037zbMath1144.90324OpenAlexW1973870109MaRDI QIDQ2384398
Lusheng Wang, Jianping Li, Hao. Zhao
Publication date: 21 September 2007
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.05.037
Deterministic network models in operations research (90B10) Applications of graph theory to circuits and networks (94C15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Improved approximation algorithms for embedding hyperedges in a cycle
- Maximizing profits of routing in WDM networks
- On minimizing the maximum congestion for weighted hypergraph embedding in a cycle
- Algorithms for routing around a rectangle
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- On the \(k\)-coloring of intervals
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- The Ring Loading Problem
- Improved Approximation Algorithms for the Demand Routing and Slotting Problem with Unit Demands on Rings
- Automata, Languages and Programming
This page was built for publication: On packing and coloring hyperedges in a cycle