Session TC-3: Approximation algorithms for graph problems in stream Approximation algorithms
Thursday, 12:00 - 13:30Room: C 104
| Session chair(s): |
|
| 54. On the Complexity of Finding Maximum Size Properly Colored Trees and Forests in Edge-Colored Graphs |
Gergely Csáji
[R] - Hungary | accepted | ||
| Yuhang Bai
[] - China | ||||
| Kristof Berczi
[] - Hungary | ||||
| Tamás Schwarcz
[R] - Hungary | ||||
| 61. Color-avoiding connected spanning subgraphs with minimum number of edges |
Kitti Varga
[R] - Hungary | accepted | ||
| 94. Approximation of disjoint A-paths via fractional matroid matching |
Gyula Pap
[R] - Hungary | accepted | ||