3019 search results - page 115 / 604 » Approximating the Domatic Number |
140
click to vote
IPSN
2007
Springer
15 years 11 months ago
2007
Springer
We consider the problem of approximating a family of isocontours in a sensor field with a topologically-equivalent family of simple polygons. Our algorithm is simple and distribu...
122
click to vote
TAMC
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We investigate the group key management problem for broadcasting applications. Previous work showed that, in handling key updates, batch rekeying can be more cost-effect...
168
click to vote
WADS
2007
Springer
15 years 11 months ago
2007
Springer
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most on...
143
click to vote
FOCS
2005
IEEE
15 years 10 months ago
2005
IEEE
Stochastic optimization problems provide a means to model uncertainty in the input data where the uncertainty is modeled by a probability distribution over the possible realizatio...
177
click to vote
APPROX
2005
Springer
15 years 10 months ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...