Jump to content

Subset sum problem: Revision history


For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)

9 March 2025

4 December 2024

13 November 2024

26 June 2024

9 June 2024

31 May 2024

23 May 2024

8 April 2024

18 August 2023

15 August 2023

8 August 2023

28 July 2023

7 July 2023

6 July 2023

14 June 2023

12 June 2023

30 April 2023

19 February 2023

18 February 2023

29 January 2023

31 December 2022

9 October 2022

27 September 2022

  • curprev 03:4203:42, 27 September 2022 Jaimecohen-cwb talk contribs m 22,550 bytes +49 Simple 1/2-approximation: Fixed the explanation on the correctness of the 1/2-approximation algorithm. The previous text said that the next item is less than T/2 but this is not necessarily true. The point is that if the sum is not greater than T/2, then, and only then, the next item is less than T/2 and it could be added to the sum, a contradiction that proves that the sum is already greater than T/2. undo Tag: Visual edit

10 September 2022

9 July 2022

15 May 2022

23 March 2022

16 March 2022

1 March 2022

10 February 2022

4 February 2022

30 January 2022

17 December 2021

16 December 2021

11 December 2021

18 October 2021

11 October 2021

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)