1 citations · 2 across the 7 of their papers we have counts for
9 papers
A Better-than-2 Approximation for k-Median Part I: The Power of General Bids
Rares-Darius Buhai, Vincent Cohen-Addad, Henry Fleischmann +6
The Greedy algorithm of Jain, Mahdian, Markakis, Saberi, and Vazirani was the best Lagrangian-multiplier-preserving (LMP) approximation algorithm for facility location, and thus th…
Spanning Adjacency Oracles in Sublinear Time
Greg Bodwin, Henry Fleischmann
Suppose we are given an -node, -edge input graph , and the goal is to compute a spanning subgraph on edges. This can be achieved in linear time via b…
On Approximability of Steiner Tree in -metrics
Henry Fleischmann, Surya Teja Gavva, Karthik C. S
In the Continuous Steiner Tree problem (CST), we are given as input a set of points (called terminals) in a metric space and ask for the minimum-cost tree connecting them. Addition…
Distinct Angles in General Position
Henry L. Fleischmann, Sergei V. Konyagin, Steven J. Miller +3
The Erdős distinct distance problem is a ubiquitous problem in discrete geometry. Somewhat less well known is Erdős' distinct angle problem, the problem of finding the minimum numb…
Irreducibility over the Max-Min Semiring
Benjamin Baily, Justine Dell, Henry L. Fleischmann +4
For sets , their sumset is . If we cannot write a set as with , then we say that is $\tex…
The Generalized Bergman Game
Benjamin Baily, Justine Dell, Irfan Durmić +8
Every positive integer may be written uniquely as a base- decomposition--that is a legal sum of powers of --where is the dominating root of a non-increasing positive line…
Limiting Spectral Distributions of Families of Block Matrix Ensembles
Teresa Dunn, Henry L. Fleischmann, Faye Jackson +5
We introduce a new matrix operation on a pair of matrices, and discuss its implications on the limiting spectral distribution. In a special case, the resultant…
Distinct Angle Problems and Variants
Henry L. Fleischmann, Hongyi B. Hu, Faye Jackson +4
The Erdős distinct distance problem is a ubiquitous problem in discrete geometry. Less well known is Erdős' distinct angle problem, the problem of finding the minimum number of dis…
Optimal Point Sets Determining Few Distinct Angles
Henry L. Fleischmann, Steven J. Miller, Eyvindur A. Palsson +2
We characterize the largest point sets in the plane which define at most 1, 2, and 3 angles. For the largest size of a point set admitting at most angles, we prove $P(2)…