Pages that link to "Item:Q1065706"
From MaRDI portal
The following pages link to Optimal search with positive switch cost is NP-hard (Q1065706):
Displaying 5 items.
- Optimal discrete search with imperfect specificity (Q999129) (← links)
- Complexity of searching an immobile hider in a graph (Q1377669) (← links)
- A search problem on a bipartite network (Q1735184) (← links)
- Online failure diagnosis in interdependent networks (Q2226505) (← links)
- Computationally-optimal real-resource strategies for independent, uninterruptible methods (Q3979382) (← links)