1040 search results - page 46 / 208 » Rounding algorithms for covering problems |
WG
2007
Springer
15 years 3 months ago
2007
Springer
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 ...
WAOA
2005
Springer
15 years 3 months ago
2005
Springer
Cellular telephony systems, where locations of mobile users are unknown at some times, are becoming more common. In such systems, mobile users are roaming in a zone and a user repo...
MST
2007
14 years 9 months ago
2007
Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discus...
CISS
2008
IEEE
15 years 4 months ago
2008
IEEE
— 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...
MST
2010
14 years 8 months ago
2010
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...