2 papers
cs.GT2024
Approximate EFX and Exact tEFX Allocations for Indivisible Chores: Improved Algorithms
Mahyar Afshinmehr, Matin Ansaripour, Alireza Danaei +1
We explore the fair distribution of a set of indivisible chores among agents, where each agent's costs are evaluated using a monotone cost function. Our focus lies on two f…
cs.DS2024
Gabow's Cardinality Matching Algorithm in General Graphs: Implementation and Experiments
Matin Ansaripour, Alireza Danaei, Kurt Mehlhorn
It is known since 1975 (\cite{HK75}) that maximum cardinality matchings in bipartite graphs with nodes and edges can be computed in time . Asymptotically fas…