Hardness of approximation: Revision history

Filter revisionsshowhide

To date:

Tag filter:

Invert selection

External tools:

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

curprev 07:3607:36, 7 August 2024 Citation bot talk contribs 3,025 bytes +47 Add: bibcode, arxiv. | Use this bot. Report bugs. | Suggested by Abductive | Category:Approximation algorithms | #UCB_Category 15/39 undo

curprev 18:5618:56, 13 December 2023 RobinK talk contribs 2,978 bytes +40 →External links undo

curprev 20:4220:42, 16 March 2022 David Eppstein talk contribs 2,938 bytes −18 Undid revision 1077532589 by Soroush Vahidi (talk) previous example was a better choice; Euclidean TSP is easy to approx and in general TSP has constant factor approx; set cover doesn't undo Tag: Undo
curprev 20:2720:27, 16 March 2022 Soroush Vahidi talk contribs 2,956 bytes +18 →Examples undo Tag: Reverted

curprev 13:2013:20, 18 April 2020 OAbot talk contribs m 2,938 bytes +49 Open access bot: hdl added to citation with #oabot. undo

curprev 15:5215:52, 29 May 2018 David Eppstein talk contribs m 2,889 bytes −1 Reverted edits by 213.55.114.173 (talk) to last version by Marcocapelle undo Tag: Rollback
curprev 09:3309:33, 29 May 2018 213.55.114.173 talk 2,890 bytes +1 →Scope undo

curprev 10:1210:12, 9 February 2018 Marcocapelle talk contribs 2,889 bytes +1 removed Category:Mathematical optimization; added Category:Relaxation (approximation) using HotCat undo

curprev 20:4220:42, 23 January 2017 24.85.232.10 talk 2,888 bytes +19 →History undo

curprev 01:3101:31, 9 July 2016 Cosmia Nebula talk contribs m 2,869 bytes 0 →History undo

curprev 20:1220:12, 29 June 2016 Tom.Reding talk contribs m 2,869 bytes −27 →External links: Rem stub tag(s) (class = non-stub & non-list) using AWB undo

curprev 19:2819:28, 22 December 2015 Rjwilmsi talk contribs m 2,896 bytes +28 →History: Journal cites, Added 1 doi to a journal cite using AWB (11757) undo

curprev 07:2507:25, 21 October 2015 David Eppstein talk contribs 2,868 bytes +4 →External links: Venkatesan Guruswami undo
curprev 07:2407:24, 21 October 2015 David Eppstein talk contribs 2,864 bytes +100 →Further reading: turn this into a real citation undo
curprev 06:5706:57, 21 October 2015 David Eppstein talk contribs m 2,764 bytes +94 →History: ce undo

curprev 22:0622:06, 13 July 2015 David Eppstein talk contribs 2,670 bytes +630 correct history — hardness of approximation was known for much longer undo

curprev 18:1818:18, 8 July 2015 JaGa talk contribs m 2,040 bytes +32 Disambiguated: algorithmic complexity → Computational complexity theory undo

curprev 19:0919:09, 28 February 2015 David Eppstein talk contribs 2,008 bytes +38 Category:Approximation algorithms undo

curprev 13:3313:33, 24 November 2014 Brirush talk contribs m 1,970 bytes +46 No edit summary undo

curprev 17:3217:32, 28 July 2014 Beamishboy talk contribs 1,924 bytes +7 →Further reading: Updated broken link to Trevisan's paper undo

curprev 09:1709:17, 14 July 2011 Diego Moya talk contribs m 1,917 bytes 0 No edit summary undo
curprev 09:0309:03, 14 July 2011 Diego Moya talk contribs 1,917 bytes +24 Wikilinks are your friends undo

curprev 21:1721:17, 1 December 2010 Will Beback Auto talk contribs m 1,893 bytes −1 clean up, replaced: early 1990's → early 1990s using AWB undo

curprev 18:0718:07, 27 September 2010 David Eppstein talk contribs m 1,894 bytes +2 fix wikilink undo
curprev 18:0718:07, 27 September 2010 David Eppstein talk contribs m 1,892 bytes 0 lowercase undo
curprev 07:4807:48, 27 September 2010 128.178.22.42 talk 1,892 bytes 0 No edit summary undo

curprev 09:1409:14, 7 September 2010 Igor Mortis~enwiki talk contribs 1,892 bytes +254 No edit summary undo

curprev 03:1703:17, 8 July 2010 Shreevatsa talk contribs m 1,638 bytes +32 linking PCP theorem undo

curprev 18:2818:28, 21 December 2009 Julesd talk contribs m 1,606 bytes 0 fixed typo undo

curprev 10:4910:49, 18 December 2009 Pcap talk contribs 1,606 bytes +17 fmt undo

curprev 02:0302:03, 26 August 2009 RobinK talk contribs 1,589 bytes +9 No edit summary undo

curprev 14:0314:03, 6 May 2009 MartinPal talk contribs 1,580 bytes +114 No edit summary undo
curprev 13:5913:59, 6 May 2009 MartinPal talk contribs 1,466 bytes +274 No edit summary undo

curprev 02:1402:14, 24 December 2008 76.226.234.131 talk 1,192 bytes +218 →External links: added syllabus undo

curprev 18:0918:09, 16 December 2008 Michael Hardy talk contribs 974 bytes −1 restrictive clause undo
curprev 18:0918:09, 16 December 2008 Michael Hardy talk contribs m 975 bytes −7 No edit summary undo

curprev 04:1504:15, 15 December 2008 The Anome talk contribs 982 bytes +4 NP-hard undo
curprev 04:1404:14, 15 December 2008 The Anome talk contribs 978 bytes +14 Category:Computational complexity theory undo
curprev 04:1304:13, 15 December 2008 The Anome talk contribs 964 bytes +71 +cats undo
curprev 03:3203:32, 15 December 2008 The Anome talk contribs 893 bytes +36 {{compsci-stub}} undo

curprev 11:0111:01, 13 December 2008 Igor Mortis~enwiki talk contribs 857 bytes +857 ←Created page with 'In computer science, hardness of approximation refers to a field which studies the complexity of approximating optimization problems. Since the early 1970's it wa...'

7 August 2024

13 December 2023

16 March 2022

18 April 2020

29 May 2018

9 February 2018

23 January 2017

9 July 2016

29 June 2016

22 December 2015

21 October 2015

13 July 2015

8 July 2015

28 February 2015

24 November 2014

28 July 2014

14 July 2011

1 December 2010

27 September 2010

7 September 2010

8 July 2010

21 December 2009

18 December 2009

26 August 2009

6 May 2009

24 December 2008

16 December 2008

15 December 2008

13 December 2008