arXiv Computation and Language By Abhinaba Chakraborty

A Group-Based Resource Allocation Model for the Fractional Knapsack Problem

Read the original on arXiv Computation and Language →

arXiv:2609. 06470v2 Announce Type: replace-cross Abstract: To solve the fractional knapsack problem, Dantzig's greedy rule orders items according to their value-to-cost ratio.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Computation and Language.

arXiv Machine Learning
Sep 10

A Sub-4 Approximation for Fair $k$-Means

arXiv:2609.07974v1 Announce Type: cross Abstract: Fairness in clustering has attracted sustained research interest, motivated by the need to ensure equitable representation of protected groups in mac...

By Kangke Cheng, Guanlin Mo, Shihong Song, Hu Ding