Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Mixed Covering of Trees and the Augmentation Problem with Odd Diameter Constraints

  • 71 Accesses

  • 11 Citations

Abstract

In this paper we present a polynomial time algorithm for solving the problem of partial covering of trees with n1 balls of radius R1 and n2 balls of radius R2 (R1 < R2) to maximize the total number of covered vertices. The solutions provided by this algorithm in the particular case R1 = R – 1, R2 = R can be used to obtain for any integer δ > 0 a factor (2+1/δ) approximation algorithm for solving the following augmentation problem with odd diameter constraints D = 2R + 1: Given a tree T, add a minimum number of new edges such that the augmented graph has diameter ≤ D. The previous approximation algorithm of Ishii, Yamamoto, and Nagamochi (2003) has factor 8.

This is a preview of subscription content, log in to check access.

Author information

Correspondence to Victor Chepoi or Bertrand Estellon or Karim Nouioua or Yann Vaxes.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Chepoi, V., Estellon, B., Nouioua, K. et al. Mixed Covering of Trees and the Augmentation Problem with Odd Diameter Constraints. Algorithmica 45, 209–226 (2006). https://doi.org/10.1007/s00453-005-1183-9

Download citation

  • Partial covering
  • Diameter
  • Augmentation problem
  • Dynamical programming
  • Approximation algorithms