Session WB-20: Complexity and Approximation in stream Combinatorial Optimization
Wednesday, 10:30-12:00Room: Esther Simpson 2.11
| Session chair(s): |
|
| 1786. On the NP-hardness of the degree-constrained network design problem |
Brieuc Pierre
[R] - Belgium | accepted | ||
| Francesco Pisanu
[] - France | ||||
| Daniele Catanzaro
[] - Belgium | ||||
| 409. Policies for the Generalised Capacitated Resupply Problem |
Mette Wagenvoort
[R] - Netherlands | accepted | ||
| Paul Bouman
[] - Netherlands | ||||
| Martijn van Ee
[R] - Netherlands | ||||
| Kerry Malone
[] - Netherlands | ||||
| 1865. Precedence-constrained shortest path |
Corinna Mathwieser
[R] - Germany | accepted | ||
| Christina Büsing
[] - Germany | ||||
| 411. On the complexity of finding central configurations of the graph-generalized (n^2 − 1)-puzzle |
Martijn van Ee
[R] - Netherlands | accepted | ||