Popular matchings with variable item copies
type: Item
instance of: scholarly article
title: Popular matchings with variable item copies
zbMATH Open document ID: 1217.68161
author: Telikepalli Kavitha
author: Meghana Nasre
published in: Theoretical Computer Science
publication date: 2011-03-14T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 91B68
zbMATH DE Number: 5865605
zbMATH Keywords: bipartite graphs
zbMATH Keywords: matchings
zbMATH Keywords: one-sided preference lists
zbMATH Keywords: NP-hardness
Wikidata QID: Q62045779
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.12.067
OpenAlex ID: W2094637312
cites work: Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
cites work: Algorithms and Computation
cites work: Popular Matchings
cites work: Using clausal graphs to determine the computational complexity of \(k\)-bounded positive one-in-three SAT
cites work: Q4871750
cites work: Bounded Unpopularity Matchings
cites work: Rank-maximal matchings
cites work: The stable marriage problem with master preference lists
cites work: Popular Mixed Matchings
cites work: Popular Matchings with Variable Job Capacities
cites work: Popular Matchings in the Capacitated House Allocation Problem
cites work: The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences
cites work: Weighted Popular Matchings
cites work: Weak versus strong domination in a market with indivisible goods
cites work: The complexity of satisfiability problems
DOI: 10.1016/J.TCS.2010.12.067
description: scientific article; zbMATH DE number 5865605