Skip to main content
SpringerLink
Log in

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

  • Published:
Algorithmica Aims and scope Submit manuscript

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 via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Laboratoire d'Informatique Fondamentale de Marseille, Faculte des Sciences de Luminy, Universite de la Mediterranee, F-13288 Marseille Cedex 9, France

    Victor Chepoi, Bertrand Estellon, Karim Nouioua & Yann Vaxes

Authors
  1. Victor Chepoi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bertrand Estellon
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Karim Nouioua
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yann Vaxes
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Victor Chepoi, Bertrand Estellon, 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

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-005-1183-9

Search

Navigation