Pages that link to "Item:Q1296580"
From MaRDI portal
The following pages link to Approximating the weight of shallow Steiner trees (Q1296580):
Displayed 8 items.
- Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications (Q849632) (← links)
- On the bounded-hop MST problem on random Euclidean instances (Q2382669) (← links)
- The lower and upper forcing geodetic numbers of block--cactus graphs (Q2432848) (← links)
- Approximating \(k\)-hop minimum-spanning trees (Q2488210) (← links)
- Bounded-hops power assignment in ad hoc wireless networks (Q2492211) (← links)
- On the characterization of the domination of a diameter-constrained network reliability model (Q2500537) (← links)
- A greedy approximation algorithm for the group Steiner problem (Q2581556) (← links)
- Differential approximation of NP-hard problems with equal size feasible solutions (Q4457890) (← links)