Session TE-2: Network Optimization in stream Discrete Optimization
Thursday, 16:45 - 18:15Room: C 103
| Session chair(s): |
|
| 79. Directed k-way Cut and Sparsest Set in Bipartite Graphs |
Daniel Szabo
[R] - Hungary | accepted | ||
| Tamás Király
[] - Hungary | ||||
| 101. Heuristics for finding largest (k,l)-sparse subgraphs |
Péter Madarasi
[R] - Hungary | accepted | ||
| Lóránt Matúz
[] - Hungary | ||||
| 147. Approximation algorithm for the weighted connected p-median problem |
Miklós Krész
[R] - Slovenia | accepted | ||
| Murat Elhüseyni
[] - Slovenia | ||||
| Burak Kocuk
[] - Turkey | ||||