Node-weighted Steiner tree approximation in unit disk graphs
type: Item
instance of: scholarly article
title: Node-weighted Steiner tree approximation in unit disk graphs
zbMATH Open document ID: 1184.90146
author: Feng Zou
author: Xianyue Li
author: Weili Wu
author: Suogang Gao
published in: Journal of Combinatorial Optimization
publication date: 2010-02-24T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 5674589
zbMATH Keywords: node-weighted Steiner tree
zbMATH Keywords: approximation algorithm
zbMATH Keywords: unit disk graphs
MaRDI profile type: Publication
full work available at URL: s10878-009-9229-6
OpenAlex ID: W2001352447
cites work: An integer linear programming approach to the steiner problem in graphs
cites work: Q3337223
cites work: An algorithm for the steiner problem in graphs
cites work: Improved Approximations for the Steiner Tree Problem
cites work: Approximations for Steiner trees with minimum number of Steiner points
cites work: A threshold of ln n for approximating set cover
cites work: Q4952635
cites work: A better constant-factor approximation for weighted dominating set in unit disk graph
cites work: A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
cites work: A fast algorithm for Steiner trees
cites work: Approximation and Online Algorithms
cites work: Q4952699
cites work: The node-weighted steiner tree problem
cites work: An 11/6-approximation algorithm for the network Steiner problem
DOI: 10.1007/S10878-009-9229-6
description: scientific article; zbMATH DE number 5674589