Spline curves are useful in a variety of geometric modeling and graphics applications and covering problems abound in practical settings. This work defines a class of covering dec...
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
We reduce the approximation factor for Vertex Cover to 2 − Θ( 1√ log n ) (instead of the previous 2 − Θ(log log n log n ), obtained by Bar-Yehuda and Even [2], and by Moni...
Using a dictionary translating a variety of classical and modern covering properties into combinatorial properties of continuous images, we get a simple way to understand the inter...