Result: The expected size of the rule k dominating set
Title:
The expected size of the rule k dominating set
Authors:
Source:
Analysis of algorithmsAlgorithmica. 46(3-4):409-418
Publisher Information:
New York, NY: Springer, 2006.
Publication Year:
2006
Physical Description:
print, 31 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Algorithme approximation, Approximation algorithm, Algoritmo aproximación, Approche probabiliste, Probabilistic approach, Enfoque probabilista, Ensemble dominant, Dominating set, Conjunto dominando, Evaluation performance, Performance evaluation, Evaluación prestación, Graphe aléatoire, Random graph, Grafo aleatorio, Modélisation, Modeling, Modelización, Optimisation, Optimization, Optimización, Optimum, Optimo, Théorie graphe, Graph theory, Teoría grafo, Dominating set. Localized algorithm, Performance analysis, Probabilistic analysis, Rule k, Unit disk graph
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Actuarial Mathematics and Statistics Department, Herriot-Watt University, Edinburgh EH14 4AS, Scotland, United Kingdom
Department of Mathematics, Drexel University, Philadelphia, PA 19104, United States
Department of Mathematics, Drexel University, Philadelphia, PA 19104, United States
ISSN:
0178-4617
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.18442325
Database:
PASCAL Archive
Further Information
Dai, Li, and Wu proposed Rule k, a localized approximation algorithm that attempts to find a small connected dominating set in a graph. In this paper we consider the average-case performance of two closely related versions of Rule k for the model of random unit disk graphs constructed from n random points in an ℓn x ℓn square. We show that if k ≥ 3 and ℓn = o(n), then for both versions of Rule k, the expected size of the Rule k dominating set is Θ(ℓ2n) as n → ∞. It follows that, for ℓn in a suitable range, the expected size of the Rule k dominating sets are within a constant factor of the optimum.