Constructing Incremental Sequences in Graphs

Authors

  • Ralf Klasing LaBRI - Université Bordeaux
  • Christian Laforest IBISC, Université d’Evry
  • Joseph Peters School of Computing Science, Simon Fraser University
  • Nicolas Thibault IBISC, Université d’Evry

Keywords:

incremental sequence, graph, approximation algorithms

Abstract

Given a weighted graph , we investigate the problem of constructing a sequence of subsets of vertices (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: . The cost of a sequence is the maximum ratio between the diameter of each group Mi and the diameter of a group with I vertices and minimum diameter:

.

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.

Downloads

Published

2006-06-30

How to Cite

Klasing, R., Laforest, C., Peters, J., & Thibault, N. (2006). Constructing Incremental Sequences in Graphs. Algorithmic Operations Research, 1(2). Retrieved from https://journals.lib.unb.ca/index.php/AOR/article/view/666

Issue

Vol. 1 No. 2 (2006)

Section

Articles

License

The copyright of the submitted article is hereby transferred to “Preeminent Academic Facets Inc. (the “publisher”) to the extent possible by the laws in the respective countries of the author(s). The author(s) retain all other rights including the following: 1. Any patents and trademark rights. 2. Right to post a pre-print version of the paper on the author’s personal website which is not used for commercial purposes. The author(s) warrant that the work is original, it has not been published elsewhere, it is not currently under consideration for publication in any form, and it does not infringe any copyright laws. The signing author or agent further warrants that all authors, if applicable, have been informed of the terms of this agreement and obtained the approval and authority to sign the agreement.