6 citations · 8 across the 18 of their papers we have counts for
3 papers · 1 filter
Continuous Patrolling Games
Steve Alpern, Thuy Bui, Thomas Lidbetter +1
We study a patrolling game played on a network , considered as a metric space. The Attacker chooses a point of (not necessarily a node) to attack during a chosen time interv…
A General Framework for Approximating Min Sum Ordering Problems
Felix Happach, Lisa Hellerstein, Thomas Lidbetter
We consider a large family of problems in which an ordering (or, more precisely, a chain of subsets) of a finite set must be chosen to minimize some weighted sum of costs. This fam…
Computational Aspects of Sturdy and Flimsy Numbers
Trevor Clokie, Thomas F. Lidbetter, Antonio Molina Lovett +2
Following Stolarsky, we say that a natural number n is flimsy in base b if some positive multiple of n has smaller digit sum in base b than n does; otherwise it is sturdy. We devel…