Socially fair matching: exact and approximation algorithms (Q6138991): Difference between revisions

@@ Property / cites work @@
+Minimizing maximum weight of subsets of a maximum matching in a bipartite graph
+Normal rank
@@ Property / cites work @@
+Budgeted matching and budgeted matroid intersection via the gasoline puzzle
+Normal rank
@@ Property / cites work @@
+Fairness through awareness
@@ Property / cites work: Fairness through awareness / rank @@
+Normal rank
@@ Property / cites work @@
+Q5090409
@@ Property / cites work: Q5090409 / rank @@
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+Fair-by-design matching
@@ Property / cites work: Fair-by-design matching / rank @@
+Normal rank
@@ Property / cites work @@
+Fair matchings and related problems
@@ Property / cites work: Fair matchings and related problems / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Procedurally fair and stable matching
@@ Property / cites work: Procedurally fair and stable matching / rank @@
+Normal rank
@@ Property / cites work @@
+Q4638098
@@ Property / cites work: Q4638098 / rank @@
+Normal rank
@@ Property / cites work @@
+The partitioning min-max weighted matching problem
+Normal rank