Finding a Level Ideal of a Poset

DOI10.1007/978-3-642-02882-3_32zbMath1248.68220OpenAlexW1521658349MaRDI QIDQ5323080

Shuji Kijima, Toshio Nemoto

Publication date: 23 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02882-3_32

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics of partially ordered sets (06A07) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Randomized algorithms (68W20) Matching models (91B68)

Related Items

Sex-equal stable matchings: complexity and exact algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Smith and Rawls share a room: stability and medians
• Every finite distributive lattice is a set of stable matchings
• On the complexity of dynamic programming for sequencing problems with precedence constraints
• An algorithm to generate the ideals of a partial order
• Median stable matching for college admissions
• The Geometry of Fractional Stable Matchings and Its Applications
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• The Complexity of Counting Stable Marriages
• Exact sampling with coupled Markov chains and applications to statistical mechanics
• Many-to-One Stable Matching: Geometry and Fairness
• The Generalized Median Stable Matchings: Finding Them Is Not That Easy
• College Admissions and the Stability of Marriage