Pages that link to "Item:Q5084651"
From MaRDI portal
The following pages link to Exact and Approximation Algorithms for the Expanding Search Problem (Q5084651):
Displaying 6 items.
- Scaling up the greedy equivalence search algorithm by constraining the search space of equivalence classes (Q1951294) (← links)
- Network construction/restoration problems: cycles and complexity (Q2168711) (← links)
- More Nearly Optimal Algorithms for Unbounded Searching, II:The Transfinite Case (Q3204044) (← links)
- (Q3348697) (← links)
- (Q4580154) (← links)
- Optimal patrolling strategies for trees and complete networks (Q6096604) (← links)