Sciweavers

5624 search results - page 51 / 1125
» On Conditional Covering Problem
Sort
View
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...
ICITS
2011
14 years 9 months ago
Homogeneous Faults, Colored Edge Graphs, and Cover Free Families
In this paper, we use the concept of colored edge graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirements...
Yongge Wang, Yvo Desmedt
NETWORKS
2007
15 years 5 months ago
Vertex disjoint routings of cycles over tori
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
Jean-Claude Bermond, Min-Li Yu
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