Skip to main content
SpringerLink
Log in

Polynomial Time Approximation Scheme for the Rectilinear Steiner Arborescence Problem

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

Given a set N of n terminals in the first quadrant of the Euclidean plane E 2, find a minimum length directed tree rooted at the origin o, connecting to all terminals in N, and consisting of only horizontal and vertical arcs oriented from left to right or from bottom to top. This problem is called rectilinear Steiner arborescence problem, which has been proved to be NP-complete recently (Shi and Su, 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), January 2000, to appear). In this paper, we present a polynomial time approximation scheme for this problem.

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. Computer Science Department, University of Minnesota, Minneapolis, MN, 55455, USA

    Bing Lu

  2. Computer Science Department, University of Minnesota, Minneapolis, MN, 55455, USA

    Lu Ruan

Authors
  1. Bing Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lu Ruan
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lu, B., Ruan, L. Polynomial Time Approximation Scheme for the Rectilinear Steiner Arborescence Problem. Journal of Combinatorial Optimization 4, 357–363 (2000). https://doi.org/10.1023/A:1009826311973

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1009826311973

Search

Navigation