DanielDadush

Name: Daniel Dadush, A Strongly Polynomial Algorithm for Linear Programs with at Most Two Non-Zero Entries per Row or Column
Start: 2026-01-27T16:30:00+09:00
End: 2026-01-27T17:30:00+09:00
Location: Room B332

S	M	T	W	T	F	S
				0 events 1 0 events, 1	0 events 2 0 events, 2	0 events 3 0 events, 3
0 events 4 0 events, 4	0 events 5 0 events, 5	0 events 6 0 events, 6	0 events 7 0 events, 7	0 events 8 0 events, 8	0 events 9 0 events, 9	0 events 10 0 events, 10
0 events 11 0 events, 11	0 events 12 0 events, 12	0 events 13 0 events, 13	0 events 14 0 events, 14	0 events 15 0 events, 15	0 events 16 0 events, 16	0 events 17 0 events, 17
0 events 18 0 events, 18	0 events 19 0 events, 19	0 events 20 0 events, 20	0 events 21 0 events, 21	0 events 22 0 events, 22	0 events 23 0 events, 23	0 events 24 0 events, 24
0 events 25 0 events, 25	0 events 26 0 events, 26	1 event 27 1 event, 27 4:30 PM - 5:30 PM Daniel Dadush, A Strongly Polynomial Algorithm for Linear Programs with at Most Two Non-Zero Entries per Row or Column January 27 Tuesday @ 4:30 PM - 5:30 PM KST Daniel Dadush, A Strongly Polynomial Algorithm for Linear Programs with at Most Two Non-Zero Entries per Row or Column We give a strongly polynomial algorithm for minimum cost generalized flow, and hence for optimizing any linear program with at most two non-zero entries per row, or at most two non-zero entries per column. Primal and dual feasibility were shown by Végh (MOR ’17) and Megiddo (SICOMP ’83) respectively. Our result can be viewed as … Continue Reading	0 events 28 0 events, 28	0 events 29 0 events, 29	0 events 30 0 events, 30	0 events 31 0 events, 31

There are no events on this day.

January 27 Tuesday

January 27 Tuesday @ 4:30 PM - 5:30 PM KST

Daniel Dadush, A Strongly Polynomial Algorithm for Linear Programs with at Most Two Non-Zero Entries per Row or Column

There are no events on this day.

DIMAG on YouTube

We use YouTube Live to broadcast seminar talks live if the speaker agrees.

Calendar of Events

Daniel Dadush, A Strongly Polynomial Algorithm for Linear Programs with at Most Two Non-Zero Entries per Row or Column