ScopeThe dramatic growth in number of powerful, easy-to-use, portable, and affordable computers, combined with globally accessible communication networks, has resulted in a large and growing user community which demands for sophisticated communication services. The realization of high-speed, high-performance, cost-effective, reliable and transparent networking requires new approaches, based on sophisticated algorithmic techniques. The workshop on Approximation and Randomized Algorithms in Communication Networks focuses on the exploitation of randomized and approximation techniques to obtain efficient solutions to these new issues arising in the area of communication networks.
TopicsPapers are solicited in all research areas related to approximation and randomized algorithms in communication networks, including, but not limited to:
PublicationProceedings of the workshop will be published by Carleton Scientific.
Guidelines for SubmissionsElectronic submissions are solicited. Authors are invited to submit their papers by sending an email containing a standard PostScript file to:
by June 3rd, 2001. Please provide the following data in the body of the mail:
Submissions should consists of an extended abstract describing original research in no more than 12 pages plus an optional appendix, with more details to be read/consulted at the discretion of the program committee. The submission should give the author's email address and fax number if available.
Simultaneous submission to other conferences with published proceedings is not allowed. It is expected that all accepted papers will be presented at the workshop.