Sciweavers

3019 search results - page 161 / 604
» Approximating the Domatic Number
Sort
View
CORR
2010
Springer
137views Education» more  CORR 2010»
15 years 6 months ago
Local algorithms in (weakly) coloured graphs
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...
Matti Åstrand, Valentin Polishchuk, Joel Ryb...
IJSNET
2008
125views more  IJSNET 2008»
15 years 6 months ago
Minimum-cost sensor arrangement for achieving wanted coverage lifetime
: Suppose we need to watch a set of targets continuously for a required period of time, and suppose we choose any number of sensors from a fixed set of sensor types and place them ...
Jie Wang, Ning Zhong
IPL
2007
81views more  IPL 2007»
15 years 6 months ago
Linear-time algorithms for problems on planar graphs with fixed disk dimension
The disk dimension of a planar graph G is the least number k for which G embeds in the plane minus k open disks, with every vertex on the boundary of some disk. Useful properties ...
Faisal N. Abu-Khzam, Michael A. Langston
COMGEO
1999
ACM
15 years 6 months ago
Optimal triangulation and quadric-based surface simplification
Many algorithms for reducing the number of triangles in a surface model have been proposed, but to date there has been little theoretical analysis of the approximations they produ...
Paul S. Heckbert, Michael Garland
TELSYS
2002
99views more  TELSYS 2002»
15 years 6 months ago
Queue Lengths and Waiting Times for Multiserver Queues with Abandonment and Retrials
We consider a Markovian multiserver queueing model with time dependent parameters where waiting customers may abandon and subsequently retry. We provide simple fluid and diffusion ...
Avishai Mandelbaum, William A. Massey, Martin I. R...