Skip to main content
SpringerLink
Log in

Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

We consider the problem of finding a minimum diameter spanning tree with maximum node degree $B$ in a complete undirected edge-weighted graph. We provide an $O(\sqrt{\log_Bn})$-approximation algorithm for the problem. Our algorithm is purely combinatorial, and relies on a combination of filtering and divide and conquer.

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. Department of Combinatorics and Optimization, University of Waterloo, 200 University Avenue West, Waterloo, Ontario, N2L 3G1, Canada

    Jochen Könemann

  2. Faculty of Industrial Engineering and Management, The Technion, Haifa 32000, Israel

    Asaf Levin

  3. Business School, University of Michigan, Ann Arbor, MI 48103, USA

    Amitabh Sinha

Authors
  1. Jochen Könemann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Asaf Levin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Amitabh Sinha
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Jochen Könemann, Asaf Levin or Amitabh Sinha.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Könemann, J., Levin, A. & Sinha, A. Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem. Algorithmica 41, 117–129 (2005). https://doi.org/10.1007/s00453-004-1121-2

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-004-1121-2

Search

Navigation