Approximations for node-weighted Steiner tree in unit disk graphs

DOI10.1007/s11590-010-0194-xzbMath1202.90267OpenAlexW1995508031MaRDI QIDQ1958644

Xianyue Li, Weili Wu, Peng-Jun Wan, Xiao-Hua Xu, Feng Zou, Yuexuan Wang, Hongwei David Du

Publication date: 4 October 2010

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-010-0194-x

zbMATH Keywords

approximation algorithmnode-weighted Steiner treeunit-disk graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (1)

Node connectivity augmentation via iterative randomized rounding

Cites Work

• An 11/6-approximation algorithm for the network Steiner problem
• Greedy approximations for minimum submodular cover with submodular cost
• On two geometric problems related to the travelling salesman problem
• Improved Approximations for the Steiner Tree Problem
• Thek-Steiner Ratio in Graphs
• A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
• Tighter Bounds for Graph Steiner Tree Approximation
• Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs

This page was built for publication: Approximations for node-weighted Steiner tree in unit disk graphs