Call for Papers


2nd International Workshop on
Approximation and Randomized Algorithms in Communication Networks
BRICS, University of Aarhus, Denmark, August 27, 2001

ALGO 2002
September 16-21
Rome ``La Sapienza''
ALGO 2001
-Online Registration (closed)
-Registration fees
-Travel and tourist Information
-Author index
ESA 2001
-Accepted papers
-Call for papers
WAE 2001
-Accepted papers
-Call for papers
WABI 2001
-Accepted papers
-Accepted posters
-Call for papers
-Call for posters
-Accepted papers
-Call for papers
[ Site map ]

The 2nd International Workshop on Approximation and Randomized Algorithms in Communication Networks - ARACNE 2001 - will collocate with ESA 2001 and WAE 2001.


The 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.


Papers are solicited in all research areas related to approximation and randomized algorithms in communication networks, including, but not limited to:
  • Network routing
  • Collective communication (broadcasting, multicasting, gossiping)
  • Network design
  • Load balancing and resource allocation
  • Fault tolerance
  • Efficient access to optical bandwidth
  • Wavelength routing and allocation in optical networks
  • Location management of mobile users
  • Frequency assignment in radio networks
  • Energy consumption in wireless networks
  • Routing in satellite constellations
  • ATM network layout
  • Scheduling in computer networks
  • Scheduling with communication delays
  • Time and resource constrained scheduling of call requests
  • On-line communication algorithms
  • Complexity issues in communication networks


Proceedings of the workshop will be published by Carleton Scientific.

Guidelines for Submissions

Electronic 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:

Corresponding author (email):

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.

Important Dates

Submissions :June 3rd, 2001
Notification :June 25th, 2001
Camera ready :July 9th, 2001

Program Committee

C. Kaklamanis (Patras, chair)
J.-C. Bermond (Sophia Antipolis)
A. Clementi (Rome)
A. Ferreira (Sophia Antipolis)
P. Fraigniaud (Paris-Sud)
K. Jansen (Kiel)
D. Krizanc (Wesleyan)
F. Meyer auf der Heide (Paderborn)
P. Persiano (Salerno)
Y. Rabani (Technion)
J. Rolim (Geneva)
P. Spirakis (Patras)
U. Vaccaro (Salerno)

Page maintained by Gerth Stølting Brodal