Matchings with lower quotas: algorithms and complexity (Q1702126): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-016-0252-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2470524007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two algorithms for the student-project allocation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some APX-completeness results for cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The college admissions problem with lower and common quotas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4291429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy Local Improvement and Weighted Set Packing Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: General factors of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hospitals/residents problem with lower quotas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation bounds for the student-project allocation problem with preferences over projects / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the serial dictatorship with project closures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost minimization in wireless networks with a bounded and unbounded number of interfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Profile-Based Optimal Matchings in the Student/Project Allocation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of factorizable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antifactors of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmics of Matching Under Preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Student-project allocation with preferences over projects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching with quorums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted Matching in Chess Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph factors and factorization: 1985--2003: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable cases of the extended global cardinality constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: General antifactors of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3012402 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002782 / rank
 
Normal rank

Latest revision as of 06:29, 15 July 2024

scientific article
Language Label Description Also known as
English
Matchings with lower quotas: algorithms and complexity
scientific article

    Statements

    Matchings with lower quotas: algorithms and complexity (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 February 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    maximum matching
    0 references
    many-to-one matching
    0 references
    project allocation
    0 references
    inapproximability
    0 references
    bounded treewidth
    0 references
    0 references