35 citations · 80 across the 10 of their papers we have counts for
Showing cs.CGShow all
2 papers · 1 filter
cs.CG2011★ 1 cited
A Doubly Exponentially Crumbled Cake
Tobias Christ, Andrea Francke, Heidi Gebauer +2
We consider the following cake cutting game: Alice chooses a set P of n points in the square (cake) [0,1]^2, where (0,0) is in P; Bob cuts out n axis-parallel rectangles with disjo…
cs.CG2008★ 4 cited
Inapproximability for metric embeddings into R^d
Jiri Matousek, Anastasios Sidiropoulos
We consider the problem of computing the smallest possible distortion for embedding of a given n-point metric space into R^d, where d is fixed (and small). For d=1, it was known th…