Sciweavers

284 search results - page 3 / 57
» On Some Polyhedra Covering Problems
Sort
View
ESA
2007
Springer
101views Algorithms» more  ESA 2007»
14 years 3 months ago
Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra
We consider the problem of ray shooting in a three-dimensional scene consisting of k (possibly intersecting) convex polyhedra with a total of n facets. That is, we want to preproc...
Haim Kaplan, Natan Rubin, Micha Sharir
JSYML
2010
95views more  JSYML 2010»
13 years 3 months ago
Some natural decision problems in automatic graphs
For automatic and recursive graphs, we investigate the following problems: (A) existence of a Hamiltonian path and existence of an infinite path in a tree (B) existence of an Euler...
Dietrich Kuske, Markus Lohrey
ESORICS
2009
Springer
14 years 9 months ago
Set Covering Problems in Role-Based Access Control
Abstract. Interest in role-based access control has generated considerable research activity in recent years. A number of interesting problems related to the well known set cover p...
Liang Chen, Jason Crampton
AAIM
2006
Springer
222views Algorithms» more  AAIM 2006»
14 years 2 months ago
Connected Set Cover Problem and Its Applications
Abstract. We study an extension of the set cover problem, the connected set cover problem, the problem is to find a set cover of minimal size that satisfies some connectivity con...
Tianping Shuai, Xiao-Dong Hu
IPL
2011
112views more  IPL 2011»
13 years 3 months ago
Improved approximation algorithms for minimum AND-circuits problem via k-set cover
Arpe and Manthey [Algorithmica’09] recently studied the minimum ANDcircuit problem, which is a circuit minimization problem, and showed some results including approximation algo...
Hiroki Morizumi