PROGRAM

Next to the lectures, the following events will take place at the Uithof Campus:

• DONET Summer School registration on Monday 08:45 - 09:45, outside Room "Rood", Transitorium 1. It is easiest to use the entrance of the Willem C. van Unnikgebouw, Heidelberglaan 2.
• IPCO VIII registration on Tuesday 16:30 - 18:00, Institute of Computing and Information Sciences, Centrumgebouw Noord, Padualaan 14, floor 0.

DONET Summer School on Integer and Combinatorial Optimization

• Lecture 1
• Lecture 2
• Lecture 3
• Lecture 4

• Lecture 1 - Lecture 4

Tuesday, June 12, Room: Aardwetenschappen - Kleine Collegezaal

10:00 - 11:00	Éva Tardos 3: "Approximation algorithms via primal-dual method: Some
	clustering problems"
11:00 - 11:30	Coffee & Tea
11:30 - 12:30	Éva Tardos 4: "Approximation algorithms in a game theoretic setting"
12:30 - 14:00	Lunch in the Educatorium
14:00 - 15:00	Dan Bienstock 3: " Oblivious rounding and derivatives
15:00 - 15:30	Coffee & Tea
15:30 - 16:30	Dan Bienstock 4: "Computational experiments with approximation algorithms for
	linear programming -- survey and new results"
17:00 - 18:30	Registration IPCO VIII, Centrumgebouw Noord, Padualaan 14, floor 0

IPCO VIII

Thursday, June 14, Room: Transitorium 1 - Wit

09:00 - 10:30	Session 5. Chairman: Gérard Cornuéjols
09:00 - 09:30	Fleischer: A 2-approximation algorithm for (0,1,2) survivable network design
09:30 - 10:00	Hassin, Levin: Synthesis of 2-commodity flow networks
10:00 - 10:30	Garg, Khandekar, Konjevod, Ravi, Salman, Sinha: On the integrality gap of a
	natural formulation of the single-sink buy-at-bulk network design problem
10:30 - 11:00	Coffee & Tea
11:00 - 12:30	Session 6. Chairman: Monique Laurent
11:00 - 11:30	Halperin, Zwick: A unified framework for obtaining improved approximation
	algorithms for maximum graph bisection problems
11:30 - 12:00	Iyengar, Çezik: Cutting planes for mixed 0-1 semidefinite programming
12:00 - 12:30	Lasserre: An explicit exact SDP relaxation for nonlinear 0-1 programs
12:30 - 14:00	Lunch in the Educatorium
14:00 - 15:00	Session 7. Chairman: Gerhard Wöginger
14:00 - 14:30	Perregaard, Balas: Generating cuts from multiple-term disjunctions
14:30 - 15:00	Miller, Nemhauser, Savelsbergh: Facets and polyhedral characterizations for a
	multi-item production planning model with setup times
15:00 - 15:30	Coffee & Tea
15:30 - 17:00	Session 8. Chairman: Bob Bixby
15:30 - 16:00	Sebö, Tannier: Connected joins in graphs
16:00 - 16:30	Frank, Szegö: An extension of a theorem of Henneberg and Laman
16:30 - 17:00	Guenin: Integral polyhedra related to even cycle and even cut matroids
18:00 - ??	IPCO Conference Dinner at Houtzaagmolen De Ster, Molenpark 3, Utrecht

Friday, June 15, Room: Unnikgebouw - 001

09:00 - 10:30	Session 9. Chairman: David Williamson
09:00 - 09:30	Azar, Regev: Strongly polynomial algorithms for the unsplittable flow problem
09:30 - 10:00	Elkin, Peleg: Approximating k-spanner problems for k>2
10:00 - 10:30	Archer: Two O(log^{*k})-approximation algorithms for the asymmetric k-center
	problem
10:30 - 11:00	Coffee & Tea
11:00 - 12:30	Session 10. Chairman: Michel Goemans
11:00 - 11:30	Fleiner: A matroid-generalization of the stable matching polytope
11:30 - 12:00	Cheriyan, Vempala: Edge coverings of set-pairs
12:00 - 12:30	Fujishige, Iwata: Bisubmodular function minimization
12:30 - 14:00	Lunch in the Educatorium
14:00 - 15:00	Session 11. Chairman: Andras Sebö
14:00 - 14:30	Sitters: On the complexity of preemptive scheduling on unrelated machines
14:30 - 15:00	Newman, Vempala: On the maximum acyclic subgraph problem
15:00 - 15:30	Coffee & Tea
15:30 - 16:30	Session 12. Chairman: Andras Frank
15:30 - 16:00	Stein, Wagner: Approximation algorithms for the minimum bends traveling
	salesman problem
16:00 - 16:30	Chudak, Roughgarden, Williamson: Approximate k-MSTs and k-Steiner trees via
	the primal-dual method and Lagrangean relaxation
16:30 - 16:45	Closing