Sciweavers

1566 search results - page 51 / 314
» On a Cone Covering Problem
Sort
View
CISS
2008
IEEE
16 years 14 days ago
Distributed computation of a sparse cover in sensor networks without location information
— In this paper, we present a distributed algorithm for detecting redundancies in a sensor network with no location information. We demonstrate how, in the absence of localizatio...
Alireza Tahbaz-Salehi, Ali Jadbabaie
MST
2010
117views more  MST 2010»
15 years 4 months ago
Class Constrained Bin Covering
We study the following variant of the bin covering problem. We are given a set of unit sized items, where each item has a color associated with it. We are given an integer paramet...
Leah Epstein, Csanád Imreh, Asaf Levin
CCCG
2008
15 years 7 months ago
Maximal Covering by Two Isothetic Unit Squares
Let P be the point set in two dimensional plane. In this paper, we consider the problem of locating two isothetic unit squares such that together they cover maximum number of poin...
Priya Ranjan Sinha Mahapatra, Partha P. Goswami, S...
CGF
2006
125views more  CGF 2006»
15 years 6 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
WG
2007
Springer
16 years 3 days ago
Minimum-Weight Cycle Covers and Their Approximability
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
Bodo Manthey