Pages that link to "Item:Q1603381"
From MaRDI portal
The following pages link to The maximum \(f\)-depth spanning tree problem (Q1603381):
Displaying 3 items.
- A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks (Q452816) (← links)
- Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) (Q706963) (← links)
- Differential approximation of NP-hard problems with equal size feasible solutions (Q4457890) (← links)
