Finding diverse solutions in combinatorial problems with a distributive lattice structure
From MaRDI portal
Cites work
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- A combinatorial strongly polynomial algorithm for minimizing submodular functions
- A structural and algorithmic study of stable matching lattices of ``nearby instances, with applications
- Discrete Convex Analysis
- Disjoint stable matchings in linear time
- Diverse pairs of matchings
- Finding diverse strings and longest common subsequences in a graph
- scientific article; zbMATH DE number 45086 (Why is no real title available?)
- scientific article; zbMATH DE number 2006645 (Why is no real title available?)
- scientific article; zbMATH DE number 1748069 (Why is no real title available?)
- scientific article; zbMATH DE number 1786487 (Why is no real title available?)
- scientific article; zbMATH DE number 887765 (Why is no real title available?)
- Introduction to lattice theory with computer science applications
- Most balanced minimum cuts
- Networks, crowds and markets. Reasoning about a highly connected world.
- On the lattices of cutsets in finite graphs
- On the parameterized complexity of diverse SAT
- Ordered sets
- Rings of sets
- Schnittverbände in Graphen. (Intersection lattices in graphs)
- The assignment game. I: The core
- The Lattice Structure of the Set of Stable Matchings with Multiple Partners
- The lattice structure of the set of stable outcomes of the multiple partners assignment game
This page was built for publication: Finding diverse solutions in combinatorial problems with a distributive lattice structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7364349)
