Pages that link to "Item:Q1763147"
From MaRDI portal
The following pages link to A polynomial time approximation scheme for minimum cost delay-constrained multicast tree under a Steiner topology (Q1763147):
Displaying 10 items.
- Steiner trees with bounded RC-delay (Q527413) (← links)
- Neural and delay based heuristics for the Steiner problem in networks (Q1296029) (← links)
- A PTAS for weight constrained Steiner trees in series--parallel graphs. (Q1401399) (← links)
- Minimum diameter cost-constrained Steiner trees (Q2436659) (← links)
- The subdivision-constrained routing requests problem (Q2436672) (← links)
- Finding cheapest deadline paths (Q2695315) (← links)
- \(k\)-pair delay constrained minimum cost routing in undirected networks (Q2768298) (← links)
- Diameter-constrained Steiner trees (Q2905280) (← links)
- (Q5400240) (← links)
- SOFSEM 2005: Theory and Practice of Computer Science (Q5711549) (← links)