Sciweavers

1566 search results - page 19 / 314
» On a Cone Covering Problem
Sort
View
ICALP
2004
Springer
14 years 4 months ago
The Minimum-Entropy Set Cover Problem
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
Eran Halperin, Richard M. Karp
ICDT
2005
ACM
128views Database» more  ICDT 2005»
14 years 4 months ago
The Pipelined Set Cover Problem
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
Kamesh Munagala, Shivnath Babu, Rajeev Motwani, Je...
COCOON
2005
Springer
14 years 4 months ago
A PTAS for a Disc Covering Problem Using Width-Bounded Separators
In this paper, we study the following disc covering problem: Given a set of discs of various radii on the plane, find a subset of discs to maximize the area covered by exactly on...
Zhixiang Chen, Bin Fu, Yong Tang, Binhai Zhu
CEC
2008
IEEE
14 years 5 months ago
Analysis of population-based evolutionary algorithms for the vertex cover problem
— Recently it has been proved that the (1+1)-EA produces poor worst-case approximations for the vertex cover problem. In this paper the result is extended to the (1+λ)-EA by pro...
Pietro Simone Oliveto, Jun He, Xin Yao
COMBINATORICS
2006
147views more  COMBINATORICS 2006»
13 years 11 months ago
A Survey on Packing and Covering Problems in the Hamming Permutation Space
Consider the symmetric group Sn equipped with the Hamming metric dH . Packing and covering problems in the finite metric space (Sn, dH ) are surveyed, including a combination of b...
Jörn Quistorff