Skip to Main content Skip to Navigation

Constructing Incremental Sequences in Graphs

Ralf Klasing 1 Christian Laforest 2 Joseph Peters 3 Nicolas Thibault 2
1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : Given a weighted graph $G=(V,E,w)$, we investigate the problem of constructing a sequence of $n=|V|$ subsets of vertices $M_1,...,M_n$ (called groups) with small diameters, where the diameter of a group is calculated using distances in $G$. The constraint on these $n$ groups is that they must be incremental: $M_1\subsetM_2 \subset...\subsetM_n=V$. The cost of a sequence is the maximum ratio between the diameter of each group $M_i$ and the diameter of a group $N_i^*$ with $i$ vertices and minimum diameter: $\max_2 \leqi \leqn \left{ \fracD(M_i)D(N_i^*) \right}$. This quantity captures the impact of the incremental constraint on the diameters of the groups in a sequence. We give general bounds on the value of this ratio and we prove that the problem of constructing an optimal incremental sequence cannot be solved approximately in polynomial time with an approximation ratio less than 2 unless $P = NP$. Finally, we give a 4-approximation algorithm and we show that the analysis of our algorithm is tight.
Document type :
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download
Contributor : Rapport de Recherche Inria <>
Submitted on : Friday, May 19, 2006 - 8:15:30 PM
Last modification on : Monday, October 12, 2020 - 10:30:21 AM
Long-term archiving on: : Sunday, April 4, 2010 - 9:02:11 PM


  • HAL Id : inria-00070361, version 1


Ralf Klasing, Christian Laforest, Joseph Peters, Nicolas Thibault. Constructing Incremental Sequences in Graphs. [Research Report] RR-5648, INRIA. 2006, pp.12. ⟨inria-00070361⟩



Record views


Files downloads