Graph-coloring - Frequency Assign Problem

1) I need to improve three algorithms of frequency Assign Problem developed with theory of graph-coloring. They were implemented with C/C++ 2) Get some metric (Utilization and Variance). I can explain these metrics. 3) Develop a new algorithm (could be another randomized algorithm) to solve optimization problem of channel assign. 4) Develop into three algorithms the thoughput metric of a flow allocated to each channel. Everything is documented. Proposal well documented ## Deliverables 1) All deliverables will be considered "work made for hire" under U.S. Copyright law. Employer will receive exclusive and complete copyrights to all work purchased. (No GPL, GNU, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the employer on the site per the worker's Worker Legal Agreement). 2) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 3) Deliverables must be in ready-to-run condition, as follows (depending on the nature of the deliverables): a) For web sites or other server-side deliverables intended to only ever exist in one place in the Employer's environment--Deliverables must be installed by the Worker in ready-to-run condition in the Employer's environment. b) For all others including desktop software or software the employer intends to distribute: A software installation package that will install the software in ready-to-run condition on the platform(s) specified in this project. ## Platform Linux or Unix