The center location improvement problem under the Hamming distance

DOI10.1007/S10878-005-6856-4zbMATH Open1079.90084OpenAlexW2091611196MaRDI QIDQ1781802FDOQ1781802

Yong He, Binwu Zhang, Jianzhong Zhang

Publication date: 8 June 2005

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-005-6856-4

Recommendations

• The complexity analysis of the shortest path improvement problem under the Hamming distance
• The shortest path improvement problems under Hamming distance
• scientific article; zbMATH DE number 1305511
• scientific article; zbMATH DE number 5631939
• Improvement of shortest path of arborescent network in the case of Hamming distance

zbMATH Keywords

Hamming distanceinapproximabilitycenter location problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Continuous location (90B85)

Cites Work

• Title not available (Why is that?)
• A network improvement problem under different norms
• Title not available (Why is that?)
• Weighted inverse minimum spanning tree problems under Hamming distance
• Improving the location of minimax facilities through network modification
• Title not available (Why is that?)

Cited In (15)

• Constrained inverse min-max spanning tree problems under the weighted Hamming distance
• Approximation algorithms for Hamming clustering problems
• Inverse minimum flow problem under the weighted sum-type Hamming distance
• A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE
• Capacity inverse minimum cost flow problems under the weighted Hamming distance
• On the Efficiency of the Hamming C-Centerstring Problems
• Inverse maximum flow problems under the weighted Hamming distance
• Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems
• An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance
• Constrained inverse minimum flow problems under the weighted Hamming distance
• Capacitated partial inverse maximum spanning tree under the weighted Hamming distance
• Inverse minimum cost flow problems under the weighted Hamming distance
• Inverse min-max spanning tree problem under the weighted sum-type Hamming distance
• The shortest path improvement problems under Hamming distance
• Weighted inverse maximum perfect matching problems under the Hamming distance

This page was built for publication: The center location improvement problem under the Hamming distance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1781802)