View the program in our Progressive Web App
Program for stream Approximation algorithms
Wednesday
Thursday
Thursday, 12:00 - 13:30
TC-03: Approximation algorithms for graph problems
Stream: Approximation algorithms
Room: C 104
Chair(s):
Gyula Pap
-
On the Complexity of Finding Maximum Size Properly Colored Trees and Forests in Edge-Colored Graphs
Gergely Csáji, Yuhang Bai, Kristof Berczi, Tamás Schwarcz -
Color-avoiding connected spanning subgraphs with minimum number of edges
Kitti Varga -
Approximation of disjoint A-paths via fractional matroid matching
Gyula Pap
Friday
Friday, 10:15 - 11:45
FB-03: Approximation algorithms for scheduling problems
Stream: Approximation algorithms
Room: C 104
Chair(s):
Tamas Kis
-
Analysis of an Approximation Algorithm for Coupled Task Scheduling with Equal Lengths of Tasks for Minimizing the Sum of Completion Times
József Békési, Gyorgy Dosa, Gábor Galambos -
Improving bounds on approximation algorithms for the Triangle Scheduling problem using Mixed Integer Quadratic Programming
Nóra Büki, János Balogh, József Békési, Gyorgy Dosa, Zsolt Tuza -
Joint replenishment meets scheduling
Tamas Kis, Péter Györgyi, Timea Tamasi