The following pages link to (Q4219034):
Displaying 7 items.
- Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods (Q477331) (← links)
- Constant time approximation scheme for largest well predicted subset (Q2377379) (← links)
- On the hardness of finding subsets with equal average (Q2444739) (← links)
- Approximability of the Subset Sum Reconfiguration Problem (Q3010386) (← links)
- Faster Pseudopolynomial Time Algorithms for Subset Sum (Q4972686) (← links)
- (Q5075820) (← links)
- Improving Schroeppel and Shamir’s algorithm for subset sum via orthogonal vectors (Q6065284) (← links)