Jump to content

Feedback vertex set: 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)

27 March 2025

20 March 2025

6 February 2025

5 February 2025

2 February 2025

20 August 2024

29 July 2024

13 June 2024

11 December 2023

4 September 2023

29 August 2023

23 July 2023

17 February 2023

4 January 2023

28 December 2022

23 December 2022

  • curprev 10:4110:41, 23 December 2022 GraphsAndAlgorithms talk contribs 15,974 bytes +1,215 Updated statement on the approximability of the problem in directed graphs: no constant factor approximation is possible in polynomial time assuming both P =/= NP and the unique games conjecture. Previously, the page only mentioned that it was not known whether such an algorithm exists for the directed version of the problem. undo Tag: Visual edit

25 July 2022

26 March 2022

13 July 2021

5 July 2021

9 May 2021

4 November 2020

25 October 2020

18 December 2019

1 October 2019

5 September 2019

10 February 2019

19 June 2018

16 May 2018

11 February 2018

17 December 2017

25 July 2017

29 April 2016

31 January 2016

20 August 2014

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