Approximations for node-weighted Steiner tree in unit disk graphs
type: Item
instance of: scholarly article
title: Approximations for node-weighted Steiner tree in unit disk graphs
zbMATH Open document ID: 1202.90267
author: Peng-Jun Wan
author: Xianyue Li
author: Weili Wu
author: Xiao-Hua Xu
author: Yuexuan Wang
author: Hongwei Du
author: Feng Zou
published in: Optimization Letters
publication date: 2010-10-04T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5795211
zbMATH Keywords: node-weighted Steiner tree
zbMATH Keywords: unit-disk graph
zbMATH Keywords: approximation algorithm
MaRDI profile type: Publication
full work available at URL: s11590-010-0194-x
OpenAlex ID: W1995508031
cites work: Thek-Steiner Ratio in Graphs
cites work: Improved Approximations for the Steiner Tree Problem
cites work: A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
cites work: On two geometric problems related to the travelling salesman problem
cites work: Tighter Bounds for Graph Steiner Tree Approximation
cites work: Greedy approximations for minimum submodular cover with submodular cost
cites work: An 11/6-approximation algorithm for the network Steiner problem
cites work: Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs
DOI: 10.1007/S11590-010-0194-X
description: scientific article; zbMATH DE number 5795211