The document discusses shared relay assignment for many-to-one traffic in cooperative networks. It proposes two new optimization problems: maximizing the minimum throughput among all sources (M21-SRA-MMT), and maximizing total throughput while maintaining fairness (M21-SRA-MTT). For M21-SRA-MMT, an approximation algorithm called RA-MM is proposed, and for M21-SRA-MTT under equal destination access time constraints, a 3-approximation algorithm called RAMT is proposed. The document also discusses existing relay assignment approaches and their disadvantages in addressing many-to-one traffic.