Polynomial Time Approximation Scheme for Symmetric Rectilinear Steiner Arborescence Problem

Authors:
Xiuzhen Cheng;Bhaskar Dasgupta;Bing Lu
Affiliations:
Computer Science Department, University of Minnesota, Minneapolis, MN 55455, USA (e-mail: cheng,blu@cs.umn.edu;Rutgers University campus at Camden e-mail: bhaskar@camden.rutgers.edu);Computer Science Department, University of Minnesota, Minneapolis, MN 55455, USA (e-mail: chengblu@cs.umn.edu
Venue:
Journal of Global Optimization
Year:
2001

Citing 6
Cited 1

Computational geometry: an introduction

Computational geometry: an introduction
On-line algorithms for Steiner tree problems (extended abstract)

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Guillotine subdivisions approximate polygonal subdivisions: a simple new method for the geometric k-MST problem

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
The dynamic servers problem

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
The rectilinear Steiner arborescence problem is NP-complete

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Optimal Information Delivery

ISAAC '95 Proceedings of the 6th International Symposium on Algorithms and Computation

Growing half-balls: minimizing storage and communication costs in CDNs

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Symmetric Rectilinear Steiner Arborescence (SRStA) problem is defined as follows: given a set of terminals in the positive quadrant of the plane, connect them using horizontal and vertical lines such that each terminal can be reached from the origin via a y-monotone path and the total length of all the line segments is the minimum possible. Finding an SRStA has applications in VLSI design, in data structures used in some optimization algorithms and in dynamic server problems. In this paper, we provide a polynomial time approximation scheme for the SRStA problem, improving the previous best approximation ratio of 3 for this problem.