Weighted Inverse Minimum Spanning Tree Problems Under Hamming Distance

ISSN： 1382-6905

Source： Journal of Combinatorial Optimization, Vol.9, Iss.1, 2005-02, pp. : 91-100

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

Inverse maximum flow problems under the weighted Hamming distance

By Liu Longcheng Zhang Jianzhong

Journal of Combinatorial Optimization, Vol. 12, Iss. 4, 2006-12 ,pp. : 395-408

Springer Publishing Company

Access to resources Recommend Favorite

The shortest path improvement problems under Hamming distance

By Zhang Binwu Zhang Jianzhong Qi Liqun

Journal of Combinatorial Optimization, Vol. 12, Iss. 4, 2006-12 ,pp. : 351-361

Springer Publishing Company

Access to resources Recommend Favorite

An Inverse-Ackermann Type Lower Bound For Online Minimum Spanning Tree Verification*

By Pettie† Seth

Combinatorica, Vol. 26, Iss. 2, 2006-04 ,pp. : 207-230

Springer Publishing Company

Access to resources Recommend Favorite

The Center Location Improvement Problem Under the Hamming Distance

By Zhang Binwu Zhang Jianzhong He Yong

Journal of Combinatorial Optimization, Vol. 9, Iss. 2, 2005-03 ,pp. : 187-198

Springer Publishing Company

Access to resources Recommend Favorite

Bounded-degree spanning tree problems: models and new algorithms

By Cerulli R. Gentili M. Iossa A.

Computational Optimization and Applications, Vol. 42, Iss. 3, 2009-04 ,pp. : 353-370

Springer Publishing Company

Access to resources Recommend Favorite