The following pages link to Network flow and 2-satisfiability (Q1317481):
Displaying 19 items.
- The minimum spanning tree problem with conflict constraints and its variations (Q429679) (← links)
- Efficient algorithms for generalized stable marriage and roommates problems (Q995571) (← links)
- The stable marriage problem with master preference lists (Q1005239) (← links)
- A compact representation for minimizers of \(k\)-submodular functions (Q1631630) (← links)
- The stable roommates problem with short lists (Q1733384) (← links)
- Stable marriage and roommates problems with restricted edges: complexity and approximability (Q1751156) (← links)
- Popular edges and dominant matchings (Q1800997) (← links)
- A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences (Q2079273) (← links)
- The complete set of minimal simple graphs that support unsatisfiable 2-CNFs (Q2192070) (← links)
- Argumentation frameworks as constraint satisfaction problems (Q2248522) (← links)
- Compact linear programs for 2SAT (Q2311345) (← links)
- Optimizing a generalized Gini index in stable marriage problems: NP-hardness, approximation and a polynomial time special case (Q2415359) (← links)
- The Stable Roommates Problem with Short Lists (Q2819460) (← links)
- A Compact Representation for Minimizers of k-Submodular Functions (Extended Abstract) (Q2835693) (← links)
- Popularity, Mixed Matchings, and Self-Duality (Q5000640) (← links)
- Quasi-Popular Matchings, Optimality, and Extended Formulations (Q5076707) (← links)
- (Q5091034) (← links)
- Computing relaxations for the three-dimensional stable matching problem with cyclic preferences (Q6073306) (← links)
- Maximum matchings and popularity (Q6490278) (← links)
