Sciweavers

2496 search results - page 2 / 500
» On covering by translates of a set
Sort
View
CGF
2006
125views more  CGF 2006»
14 years 11 months ago
Translational Covering of Closed Planar Cubic B-Spline Curves
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...
Cristina Neacsu, Karen Daniels
FOCS
2008
IEEE
15 years 22 days ago
Set Covering with our Eyes Closed
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...
Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi,...
ICALP
2005
Springer
15 years 5 months ago
A Better Approximation Ratio for the Vertex Cover Problem
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...
George Karakostas
68
Voted
CCCG
2003
15 years 1 months ago
A combinatorial maximum cover approach to 2D translational geometric covering
Karen Daniels, Arti Mathur, Roger Grinde
JSYML
2008
98views more  JSYML 2008»
14 years 11 months ago
Combinatorial images of sets of reals and semifilter trichotomy
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...
Boaz Tsaban, Lyubomyr Zdomskyy