The following pages link to Thomas F. Lidbetter (Q1622952):
Displaying 37 items.
- Additive number theory via approximation by regular languages (Q1622953) (← links)
- Counting subwords and regular languages (Q1622966) (← links)
- Optimizing periodic patrols against short attacks on the line and other networks (Q1631529) (← links)
- (Q1694816) (redirect page) (← links)
- On the approximation ratio of the random Chinese postman tour for network search (Q1694817) (← links)
- The expanding search ratio of a graph (Q1741496) (← links)
- Searching for multiple objects in multiple locations (Q1999403) (← links)
- A game theoretic approach to a problem in polymatroid maximization (Q2098075) (← links)
- Computational aspects of sturdy and flimsy numbers (Q2163377) (← links)
- A search game on a hypergraph with booby traps (Q2173302) (← links)
- Search and delivery man problems: when are depth-first paths optimal? (Q2184055) (← links)
- Search and rescue in the face of uncertain threats (Q2184077) (← links)
- Competitive search in a network (Q2184175) (← links)
- Approximate solutions for expanding search games on general networks (Q2327672) (← links)
- Bounds on the burning numbers of spiders and path-forests (Q2328861) (← links)
- The largest-Z-ratio-first algorithm is 0.8531-approximate for scheduling unreliable jobs on \(m\) parallel machines (Q2661490) (← links)
- The solution to an open problem for a caching game (Q2808489) (← links)
- Search Games with Multiple Hidden Objects (Q2862458) (← links)
- A Caching Game with Infinitely Divisible Hidden Material (Q2949985) (← links)
- Patrolling a Border (Q2957456) (← links)
- Search Games for an Immobile Hider (Q2961391) (← links)
- Patrolling a Pipeline (Q3179196) (← links)
- Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object (Q3195234) (← links)
- The expanding search ratio of a graph (Q4601858) (← links)
- Continuous Patrolling Games (Q5060487) (← links)
- A General Framework for Approximating Min Sum Ordering Problems (Q5087715) (← links)
- On Submodular Search and Machine Scheduling (Q5108249) (← links)
- Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games (Q5126630) (← links)
- Searching a Variable Speed Network (Q5244863) (← links)
- Mining Coal or Finding Terrorists: The Expanding Search Paradigm (Q5301126) (← links)
- Additive Number Theory via Approximation by Regular Languages (Q5859643) (← links)
- Improved bound for the Gerver-Ramsey collinearity problem (Q6080207) (← links)
- Optimal patrolling strategies for trees and complete networks (Q6096604) (← links)
- The search and rescue game on a cycle (Q6100190) (← links)
- Periodic Patrols on the Line and Other Networks (Q6287254) (← links)
- Computational Aspects of Sturdy and Flimsy Numbers (Q6334304) (← links)
- A Game Theoretic Approach to a Problem in Polymatroid Maximization (Q6365771) (← links)