On Randomized Approximation for Finding a Level Ideal of a Poset and the Generalized Median Stable Matchings

DOI10.1287/moor.1110.0526zbMath1238.68185OpenAlexW2051572576MaRDI QIDQ2884322

Toshio Nemoto, Shuji Kijima

Publication date: 24 May 2012

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.1110.0526

zbMATH Keywords

randomized algorithmsorder idealsstable marriage\# P-hard randomized approximation scheme (FPRAS)

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Approximation algorithms (68W25) Randomized algorithms (68W20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (2)

Every finite distributive lattice is isomorphic to the minimizer set of an \(M^\natural \)-concave set function ⋮ Unnamed Item

This page was built for publication: On Randomized Approximation for Finding a Level Ideal of a Poset and the Generalized Median Stable Matchings