TCS / Studies / T-79.4201 / Thispage
Helsinki University of Technology, 
     Laboratory for Theoretical Computer Science

Results for round 1

Programs were tested by running each with 30 graphs for 10 minutes. 10 of the graphs had a frequency assingment of size 8, 10 had an assignment of size 11 and last 10 had assignment of size 13.

The quality of a solution was calculated with the formula goodness = 1000 * (found - optimal) / (degree +1 - optimal) where degree is the degree of the graph (every graph has a coloring of degree+1 that can be found with a greedy algorithm). The goodness of solutions were summed and extra points granted according to the sums

studentsumextra points
55128L6092
57973E43910
58435M992
58573T47380
58587M24061
60707C4482
60925N45690
61401P16601
63306V45690
63826F38560
63827H41900
64844U18181
68772N382
68774R9762
68780A25081
76469R58570

[TCS main] [Contact Info] [Personnel] [Research] [Publications] [Software] [Studies] [News Archive] [Links]
Latest update: 05 December 2006.