The following pages link to (Q3181697):
Displaying 11 items.
- Some algorithmic results for [2]-sumset covers (Q458372) (← links)
- Discrepancy one among homogeneous arithmetic progressions (Q503637) (← links)
- Approximation schemes for parallel machine scheduling with availability constraints (Q642981) (← links)
- Subset sum problems with digraph constraints (Q1631654) (← links)
- Faster algorithms for \(k\)-subset sum and variations (Q2105266) (← links)
- Approximation schemes for subset-sums ratio problems (Q2167894) (← links)
- Approximating subset sum ratio via subset sum computations (Q2169941) (← links)
- On the hardness of finding subsets with equal average (Q2444739) (← links)
- Simple FPTAS for the subset-sums ratio problem (Q2445243) (← links)
- (Q5075820) (← links)
- Approximating subset sum ratio via partition computations (Q6541032) (← links)