Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets

ISSN： 0890-5401

Source： Information and Computation, Vol.150, Iss.1, 1999-04, pp. : 57-74

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A Characterization of Graphs with Disjoint Dominating and Total Dominating Sets

By Henning Michael A. Southey Justin

Quaestiones Mathematicae, Vol. 32, Iss. 1, 2009-03 ,pp. : 119-129

Taylor & Francis Ltd

Access to resources Recommend Favorite

On Equations of Ellipsoids Approximating Attainable Sets

By Ovseevich A.I.

Journal of Optimization Theory and Applications, Vol. 95, Iss. 3, 1997-12 ,pp. : 659-676

Springer Publishing Company

Access to resources Recommend Favorite

Planar Rectangular Sets and Steiner Symmetrization

By Scott Paul

Elemente der Mathematik, Vol. 53, Iss. 1, 1998-02 ,pp. : 36-39

Springer Publishing Company

Access to resources Recommend Favorite

γ-connected sets

By Császár Á.

Acta Mathematica Hungarica, Vol. 101, Iss. 4, 2003-01 ,pp. : 273-279

Springer Publishing Company

Access to resources Recommend Favorite

Dominating Sets for Convex Functions with Some Applications

By Carrizosa E. Frenk J.B.G.

Journal of Optimization Theory and Applications, Vol. 96, Iss. 2, 1998-02 ,pp. : 281-295

Springer Publishing Company

Access to resources Recommend Favorite