Constrained Inverse Minimum Spanning Tree Problems under the Bottleneck-Type Hamming Distance

Author： Zhang Binwu   Zhang Jianzhong   He Yong  

Publisher： Springer Publishing Company

ISSN： 0925-5001

Source： Journal of Global Optimization, Vol.34, Iss.3, 2006-03, pp. : 467-474

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

The Complexity of Minimum Ratio Spanning Tree Problems

By Skiścim Christopher   Palocsay Susan  

Journal of Global Optimization, Vol. 30, Iss. 4, 2004-12 ,pp. : 335-346

Springer Publishing Company

Access to resources Recommend Favorite

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

By Gouveia Luis  

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

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

Linear-time algorithms for parametric minimum spanning tree problems on planar graphs

By Fernandez-Baca D.   Slutzki G.  

Theoretical Computer Science, Vol. 181, Iss. 1, 1997-07 ,pp. : 57-74

Elsevier

Access to resources Recommend Favorite

On the Hamming distance of constraint satisfaction problems

By Crescenzi P.   Rossi G.  

Theoretical Computer Science, Vol. 288, Iss. 1, 2002-10 ,pp. : 85-100

Elsevier

Access to resources Recommend Favorite