The shortest path improvement problems under Hamming distance

Binwu Zhang (), Jianzhong Zhang () and Liqun Qi ()
Additional contact information
Binwu Zhang: Hohai University
Jianzhong Zhang: The Chinese University of Hong Kong
Liqun Qi: Hong Kong Polytechnic University

Journal of Combinatorial Optimization, 2006, vol. 12, issue 4, No 4, 361 pages

Abstract: Abstract In this paper, we consider the shortest path improvement problems under Hamming distance (SPIH), where the weights of edges can be modified only within given intervals. Two models are considered: the general SPIH problem and the SPIH problem with a single pair of required vertices. For the first problem, we show that it is strongly NP-hard. For the second problem, we show that even if the network is a chain network, it is still NP-hard.

Keywords: Shortest path problem; NP-hard; Hamming distance (search for similar items in EconPapers)
Date: 2006
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-006-9000-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:12:y:2006:i:4:d:10.1007_s10878-006-9000-1

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-006-9000-1

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().