553 search results - page 3 / 111 » Cover Contact Graphs |
ICALP
2001
Springer
13 years 12 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
PODC
2009
ACM
14 years 8 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
SPAA
2010
ACM
14 years 7 days ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
INFOCOM
2010
IEEE
13 years 5 months ago
2010
IEEE
—Delay Tolerant Networks (DTN) are networks of self-organizing wireless nodes, where end-to-end connectivity is intermittent. In these networks, forwarding decisions are generall...
HAPTICS
2010
IEEE
13 years 5 months ago
2010
IEEE
Interactions with virtual worlds using the sense of touch, called haptic rendering, have natural applications in many domains such as health or industry. For an accurate and realis...