Polynomial time approximation scheme for the rectilinear Steiner arborescence problem
type: Item
instance of: scholarly article
title: Polynomial time approximation scheme for the rectilinear Steiner arborescence problem
zbMATH Open document ID: 0969.90074
DOI: 10.1023/A:1009826311973
author: B. Lu
author: Lu Ruan
published in: Journal of Combinatorial Optimization
publication date: 2001-10-07T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 1538193
zbMATH Keywords: PTAS
zbMATH Keywords: arborescence
zbMATH Keywords: Steiner terminals
zbMATH Keywords: VLSI design
zbMATH Keywords: approximation algorithm
MaRDI profile type: Publication
full work available at URL: a:1009826311973
OpenAlex ID: W1503993426
Recommended article: Polynomial time approximation scheme for symmetric rectilinear Steiner arborescence problem
Recommended article: The rectilinear Steiner arborescence problem
Recommended article: Q2934724
Recommended article: Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems
Recommended article: Faster approximation algorithms for the rectilinear Steiner tree problem
Recommended article: Q5743426
Recommended article: A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest
Recommended article: Q4952700
Recommended article: The Rectilinear Steiner Arborescence Problem Is NP-Complete
description: scientific article; zbMATH DE number 1538193