Stable marriage and roommates problems with restricted edges: complexity and approximability (Q1751156): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2016.03.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2509758454 / rank
 
Normal rank
Property / cites work
 
Property / cites work: College Admissions and the Stability of Marriage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on the stable matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the “stable roommates” problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deferred acceptance algorithms: history, theory, practice, and open questions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The stable marriage problem with restricted pairs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new fixed point approach for stable networks and stable marriages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of stable matchings as extreme points of a polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network flow and 2-satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for generalized stable marriage and roommates problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Stable Roommates Problem with Ties / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line algorithms for weighted bipartite matching and stable marriages / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation lower bound for finding almost stable maximum matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size versus stability in the marriage problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``Almost stable'' matchings in the roommates problem with bounded preference lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501851 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Geometry of Fractional Stable Matchings and Its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable marriage with ties and bounded length preference lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: A necessary and sufficient condition for the existence of a complete stable matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex cover might be hard to approximate to within \(2 - \varepsilon \) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A maximum stable matching for the roommates problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new solution concept for the roommate problem: \(\mathcal{Q}\)-stable matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Socially Stable Matchings in the Hospitals/Residents Problem / rank
 
Normal rank

Latest revision as of 17:06, 15 July 2024

scientific article
Language Label Description Also known as
English
Stable marriage and roommates problems with restricted edges: complexity and approximability
scientific article

    Statements

    Stable marriage and roommates problems with restricted edges: complexity and approximability (English)
    0 references
    0 references
    0 references
    24 May 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    stable matching
    0 references
    restricted edge
    0 references
    approximation algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references