Algorithms for routing around a rectangle
From MaRDI portal
Publication:1208452
DOI10.1016/0166-218X(92)90007-WzbMath0764.68068MaRDI QIDQ1208452
Hitoshi Suzuki, Takao Nishizeki, Éva Tardos, Nobuji Saito, András Frank
Publication date: 16 May 1993
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (14)
Improved approximation algorithms for embedding hyperedges in a cycle ⋮ The weighted link ring loading problem ⋮ On packing and coloring hyperedges in a cycle ⋮ Sonet ring sizing with genetic algorithms ⋮ A polynomial time approximation scheme for embedding hypergraph in a weighted cycle ⋮ Exact solution of the SONET ring loading problem ⋮ Integral polyhedra related to integer multicommodity flows on a cycle ⋮ A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting ⋮ Multicommodity flows in cycle graphs ⋮ A Note on the Ring Loading Problem ⋮ Routing to reduce the cost of wavelength conversion ⋮ Optimal online ring routing ⋮ On minimizing the maximum congestion for weighted hypergraph embedding in a cycle ⋮ A polynomial time approximation scheme for embedding a directed hypergraph on a ring
Cites Work
This page was built for publication: Algorithms for routing around a rectangle
