Session MD-20: Problems on graphs in stream Combinatorial Optimization
Monday, 14:30-16:00Room: Esther Simpson 2.11
| Session chair(s): |
|
| 1879. Graph Sparsification to Preserve Connectivity: a GRASP approach |
Claude PETIT
[R] - France | accepted | ||
| Alexandru Olteanu
[] - France | ||||
| Quentin Perrachon
[] - France | ||||
| Marc Sevaux
[R] - France | ||||
| 463. On Satisfying Connectivity Requirements In Digraphs With Arc Operations |
Matheus Corrêa
[R] - Brazil | accepted | ||
| Abilio Lucena
[] - Brazil | ||||
| 2910. A stable set based branch and bound algorithm for the shortest path problem with conflicts |
BAHADIR PAMUK
[R] - United Kingdom | accepted | ||
| I. Kuban Altinel
[] - Turkey | ||||
| Temel Öncan
[] - Turkey | ||||
| 1621. Minimizing Dissatisfaction of an Allocation on a Common Preference Graph |
Ulrich Pferschy
[R] - Austria | accepted | ||
| Nina Chiarelli
[] - Slovenia | ||||
| Clément Dallard
[] - France | ||||
| Andreas Darmann
[] - Austria | ||||
| Stefan Lendl
[] - Austria | ||||
| Martin Milanic
[] - Slovenia | ||||
| Peter Mursic
[] - Slovenia | ||||