An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.146, Iss.1, 2006-09, pp. : 19-39

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

Computing a (1+ε)-Approximate Geometric Minimum-Diameter Spanning Tree

By Spriggs Michael J. Keil J. Mark Bespamyatnikh Sergei Segal Michael Snoeyink Jack

Algorithmica, Vol. 38, Iss. 4, 2004-01 ,pp. : 577-589

Springer Publishing Company

Access to resources Recommend Favorite

Improved heuristics for the bounded-diameter minimum spanning tree problem

By Singh Alok Gupta Ashok

Soft Computing, Vol. 11, Iss. 10, 2007-08 ,pp. : 911-921

Springer Publishing Company

Access to resources Recommend Favorite

Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem

By Könemann Jochen Levin Asaf Sinha Amitabh

Algorithmica, Vol. 41, Iss. 2, 2004-11 ,pp. : 117-129

Springer Publishing Company

Access to resources Recommend Favorite

Degree constrained minimum spanning tree problem: a learning automata approach

By Akbari Torkestani Javad

The Journal of Supercomputing, Vol. 64, Iss. 1, 2013-04 ,pp. : 226-249

Springer Publishing Company

Access to resources Recommend Favorite

Approximations for Steiner trees with minimum number of Steiner points

By Chen

Theoretical Computer Science, Vol. 262, Iss. 1, 2001-07 ,pp. : 83-99

Elsevier

Access to resources Recommend Favorite