Bottleneck subset-type restricted matching problems

Oleg Duginov ()
Additional contact information
Oleg Duginov: Belarusian State University

Journal of Combinatorial Optimization, 2020, vol. 40, issue 3, No 11, 796-805

Abstract: Abstract We introduce two problems related to finding in a weighted complete bipartite graph a special matching such that the maximum weight of its some subsets is minimal. We discuss their applications and show the strong NP-hardness of both problems. We show that one problem cannot be approximated in polynomial time within a factor of less than 2 and another problem cannot be approximated in polynomial time within a factor of $$\alpha (n)$$ α ( n ) , where $$\alpha (n)$$ α ( n ) is an arbitrary polynomial-time computable function, unless $$\hbox {P} = \hbox {NP}$$ P = NP .

Keywords: Matching; Edge weighted complete bipartite graph; Computational complexity; Inapproximability (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-020-00627-8 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:40:y:2020:i:3:d:10.1007_s10878-020-00627-8

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

DOI: 10.1007/s10878-020-00627-8

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 ().