Pages that link to "Item:Q931730"
From MaRDI portal
The following pages link to Simultaneous matchings: Hardness and approximation (Q931730):
Displaying 17 items.
- Broken triangles: from value merging to a tractable class of general-arity constraint satisfaction problems (Q253988) (← links)
- Cardinality constraints and systems of restricted representatives (Q266031) (← links)
- Structural decompositions for problems with global constraints (Q272005) (← links)
- The minimum maximal k-partial-matching problem (Q395867) (← links)
- Solving (large scale) matching problems combinatorially (Q750322) (← links)
- Complexity of matching problems (Q1099615) (← links)
- Filtering algorithms for global chance constraints (Q1761302) (← links)
- Bottleneck subset-type restricted matching problems (Q2023130) (← links)
- On tree-constrained matchings and generalizations (Q2258075) (← links)
- \(\mathcal{IV}\)-matching is strongly \textsf{NP}-hard (Q2628277) (← links)
- Hardness and approximation of minimum maximal matchings (Q2935383) (← links)
- The Complexity of Rationalizing Matchings (Q3596716) (← links)
- A note on the hardness results for the labeled perfect matching problems in bipartite graphs (Q3598040) (← links)
- Matching with sizes (or scheduling with processing set restrictions) (Q5891543) (← links)
- Matching with sizes (or scheduling with processing set restrictions) (Q5892177) (← links)
- Computational complexity of simultaneous elementary matching problems (Q5900977) (← links)
- On the maximum edge-pair embedding bipartite matching (Q5918365) (← links)