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

Authors:
Binwu Zhang;Jianzhong Zhang;Yong He
Affiliations:
Aff1 Aff3;Department of Mathematics, City University of Hong Kong, Hong Kong, China;Department of Mathematics, Zhejiang University, Hangzhou, China
Venue:
Journal of Global Optimization
Year:
2006

Citing 0
Cited 8

Inverse min-max spanning tree problem under the Weighted sum-type Hamming distance

Theoretical Computer Science
Constrained inverse min---max spanning tree problems under the weighted Hamming distance

Journal of Global Optimization
Efficient algorithms for the inverse sorting problem with bound constraints under the l∞-norm and the Hamming distance

Journal of Computer and System Sciences
Heuristic algorithms for the inverse mixed integer linear programming problem

Journal of Global Optimization
Inverse bottleneck optimization problems on networks

AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Weighted inverse minimum cut problem under the sum-type hamming distance

FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Inverse min-max spanning tree problem under the weighted sum-type hamming distance

ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Weighted inverse maximum perfect matching problems under the Hamming distance

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider the inverse minimum spanning tree problem under the bottleneck-type Hamming distance, where the weights of edges can be modified only within given intervals. We further consider the constrained case in which the total modification cost cannot exceed a given upper bound. It is shown that these inverse problems can be transformed into a minimum node cover problem on a bipartite graph, and we give a strongly polynomial time algorithm to solve this type of node cover problems.