Pages that link to "Item:Q1208452"
From MaRDI portal
The following pages link to Algorithms for routing around a rectangle (Q1208452):
Displaying 14 items.
- Improved approximation algorithms for embedding hyperedges in a cycle (Q293373) (← links)
- A polynomial time approximation scheme for embedding hypergraph in a weighted cycle (Q650915) (← links)
- The weighted link ring loading problem (Q839671) (← links)
- Integral polyhedra related to integer multicommodity flows on a cycle (Q968136) (← links)
- A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting (Q982669) (← links)
- Routing to reduce the cost of wavelength conversion (Q1005233) (← links)
- On minimizing the maximum congestion for weighted hypergraph embedding in a cycle (Q1014437) (← links)
- A polynomial time approximation scheme for embedding a directed hypergraph on a ring (Q1045935) (← links)
- Sonet ring sizing with genetic algorithms (Q1362967) (← links)
- Exact solution of the SONET ring loading problem (Q1962832) (← links)
- On packing and coloring hyperedges in a cycle (Q2384398) (← links)
- Multicommodity flows in cycle graphs (Q2499583) (← links)
- A Note on the Ring Loading Problem (Q2790401) (← links)
- Optimal online ring routing (Q3082608) (← links)
