Jump to content

Multi-commodity flow 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)

19 November 2024

23 September 2024

16 July 2024

29 May 2024

25 October 2023

21 September 2023

14 September 2023

22 August 2023

1 June 2023

30 March 2023

27 March 2023

12 March 2023

27 December 2022

21 December 2022

19 May 2022

14 January 2021

6 October 2020

21 February 2020

29 January 2020

19 January 2020

19 December 2019

1 December 2019

6 October 2019

27 August 2019

17 August 2019

27 June 2019

  • curprev 16:4716:47, 27 June 2019 Al-Quaknaa talk contribs 5,378 bytes +9 Removed a reference to a preprint paper claiming a combinatorial algorithm. I have read this paper and I don't find it convincing. In particular, the paper never shows that the algorithm makes polynomialy many iterations, and I'm not convinced of its correctness (even if it is allowed to run exponentially long). Moreover, since this reference uses the same strange word "conception" (rather than "concept" or "notion"). this seems like a self-promotory addition. Hence I remove it. undo

1 May 2019

13 March 2019

19 August 2018

21 February 2018

11 February 2018

8 February 2018

16 November 2017

1 February 2017

7 December 2016

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