Jump to content

Polynomial-time approximation scheme: 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)

19 December 2024

7 August 2024

2 April 2023

1 February 2023

4 July 2022

28 May 2022

13 December 2021

6 July 2021

1 February 2021

  • curprev 12:1212:12, 1 February 2021 5.44.169.192 talk 7,041 bytes −19 Removed bin packing from the examples of problems that have FPTAS (section "Deterministic" first paragraph). Bin packing does NOT have an FPTAS. This problem does not even have a (3/2-eps)-approximation! In Vazirani's book there is a an asymptotic PTAS for bin packing, but that's a different thing. undo

10 January 2021

13 June 2020

11 June 2020

1 April 2020

15 March 2019

22 August 2018

7 July 2018

10 October 2017

10 August 2017

22 June 2017

29 October 2016

30 September 2016

5 September 2016

4 July 2016

19 September 2015

10 December 2014

9 December 2014

9 November 2013

8 November 2013

5 September 2013

23 March 2013

28 February 2013

4 January 2013

18 July 2012

15 May 2012

11 May 2012

8 September 2011

30 May 2011

6 April 2011

3 April 2011

19 February 2011

23 November 2010

20 October 2010

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