27 citations · 27 across the 3 of their papers we have counts for
4 papers
A Finitist's Manifesto: Do we need to Reformulate the Foundations of Mathematics?
Jonathan Lenchner
There is a problem with the foundations of classical mathematics, and potentially even with the foundations of computer science, that mathematicians have by-and-large ignored. This…
On a Generalization of the Marriage Problem
Jonathan Lenchner
We present a generalization of the marriage problem underlying Hall's famous Marriage Theorem to what we call the Symmetric Marriage Problem, a problem that can be thought of as a…
From Hall's Marriage Theorem to Boolean Satisfiability and Back
Jonathan Lenchner
Motivated by the application of Hall's Marriage Theorem in various LP-rounding problems, we introduce a generalization of the classical marriage problem (CMP) that we call the Frac…
Minimum-Cost Coverage of Point Sets by Disks
Esther M. Arkin, Herve Broennimann, Jeff Erickson +5
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (t_j) and radii (r_j) that cover a given set o…