Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs

    The node-weighted Steiner tree problem is a variation of classical Steiner minimum tree problem. Given a graph G = (V,E) with node weight function C:VR  +  and a subset X of V, the node-weighted ...

    **anyue Li, **ao-Hua Xu, Feng Zou in Combinatorial Optimization and Applications (2009)