Projects of academic year 2003-2004
Project 1 (Ring Covers)
Background papers for this project: CoverRing.pdf , NetSolver.pdf
Project 2 (Radial Drawing)
Project 3 (Approximations)
You can choose any of the above problems (NP-complete) and find-discuss 5-6 heuristics/approximation algorithms.
- 3 - coloring
- vertex cover
- clique
- biconnectivity augmentation
- graph bipartition
- degree constraint spanning trees
- longest circles & paths
You must choose one out of 3 projects. Each team (of 2 students) must sent an e-mail at the mailing list with the project that will present. If your team prefers to write down Notes instead, you should send an email mentioning the subject you will work (first come, first served) .