The center location improvement problem under the Hamming distance

DOI10.1007/s10878-005-6856-4zbMath1079.90084OpenAlexW2091611196MaRDI QIDQ1781802

Yong He, Binwu Zhang, Zhang, Jianzhong

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

zbMATH Keywords

center location problemHamming distanceinapproximability

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

• A network improvement problem under different norms
• Weighted inverse minimum spanning tree problems under Hamming distance
• Improving the location of minimax facilities through network modification
• Unnamed Item
• Unnamed Item
• Unnamed Item