Pages that link to "Item:Q294629"
From MaRDI portal
The following pages link to On the complexity of quality of service routing (Q294629):
Displaying 14 items.
- Multi-postpath-based lookahead multiconstraint QoS routing (Q378623) (← links)
- Polynomial time approximation schemes for the constrained minimum spanning tree problem (Q442910) (← links)
- A survey on multi-constrained optimal path computation: exact and approximate algorithms (Q612751) (← links)
- Highly responsive and efficient QoS routing using pre- and on-demand computations along with a new normal measure (Q852519) (← links)
- Search space reduction in QoS routing. (Q1398820) (← links)
- Efficient QoS routing. (Q1426020) (← links)
- Precomputation for intra-domain QoS routing (Q1775055) (← links)
- Complexity results on labeled shortest path problems from wireless routing metrics (Q2270086) (← links)
- Sensible decisions based on QoS (Q2386623) (← links)
- Dynamic online QoS routing schemes: Performance and bounds (Q2489588) (← links)
- (Q2777023) (← links)
- Unicast and multicast QoS routing with soft-constraint logic programming (Q2946622) (← links)
- On the Convexity of Feasible QoS Regions (Q3548136) (← links)
- Packet Routing: Complexity and Algorithms (Q3558928) (← links)