Sciweavers

4255 search results - page 89 / 851
» Cover
Sort
View
101
Voted
CCCG
1998
15 years 3 months ago
On point covers of c-oriented polygons
Let S be any family of n c-oriented polygons of the two-dimensional Euclidean plane E2 , i.e., bounded intersection of halfplanes whose normal directions of edges belong to a
Frank Nielsen
SODA
2000
ACM
78views Algorithms» more  SODA 2000»
15 years 3 months ago
Strengthening integrality gaps for capacitated network design and covering problems
Robert D. Carr, Lisa Fleischer, Vitus J. Leung, Cy...
ACL
1989
15 years 3 months ago
How to Cover a Grammar
A novel formalism is presented for Earley-like parsers. It accommodates the simulation of non-deterministic pushdown automata. In particular, the theory is applied to non-determin...
René Leermakers
112
Voted
ESA
2010
Springer
202views Algorithms» more  ESA 2010»
15 years 3 months ago
Optimal Cover of Points by Disks in a Simple Polygon
Haim Kaplan, Matthew J. Katz, Gila Morgenstern, Mi...