Weighted inverse maximum perfect matching problems under the Hamming distance

Longcheng Liu () and Enyu Yao

Journal of Global Optimization, 2013, vol. 55, issue 3, 549-557

Abstract: Given an undirected network G(V, E, c) and a perfect matching M 0 , the inverse maximum perfect matching problem is to modify the cost vector as little as possible such that the given perfect matching M 0 can form a maximum perfect matching. The modification can be measured by different norms. In this paper, we consider the weighted inverse maximum perfect matching problems under the Hamming distance, where we use the weighted Hamming distance to measure the modification of the edges. We consider both of the sum-type and the bottleneck-type problems. For the general case of the sum-type case, we show it is NP-hard. For the bottleneck-type, we present a strongly polynomial algorithm which can be done in O(m · n 3 ). Copyright Springer Science+Business Media, LLC. 2013

Keywords: Maximum perfect matching; Inverse problem; Hamming distance; NP-hard; Strongly polynomial algorithm (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10898-012-9901-8 (text/html)
Access to full text is restricted to subscribers.

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:jglopt:v:55:y:2013:i:3:p:549-557

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-012-9901-8

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

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