9:00 - 10:00
(Invited Talk)
Complicating Factors for the
Use of Distributed Algorithms in Wireless Networks,
A. Ephremides
10:00 - 10:30 Coffee Break
10:30 - 10:55
The Complexity of Base Station
Positioning in Cellular Networks,
C. Glasser, S.Reith and H. Vollmer
10:55 - 11:20
Distributive Online Channel
Assignment for Hexagonal Cellular Networks
with Constraints,
S. Fitzpatrick, J. Janssen and
R. Nowakowski
11:20 - 11:45
Coloring Circular Arcs with
Applications to WDM Routing,
A. L. Gargano and A. Rescigno
11:45 - 12:10
Wavelength Routing of Uniform
Instances in Optical Rings,
L. Narayanan and J. Opatrny
12:10 - 12:35
Experimental Evaluation of Approximation
Algorithms for the Minimum Cost Multiple-source Unsplittable Flow Problem,
Y. Asano
12:35 - 14:00 Lunch Break
14:00 - 14:25
Conversion of Coloring Algorithms
into Maximum Weight Independent Set Algorithms
T. Erlebach and K. Jansen
14:25 - 14:50
Efficient Communication Establishment
in Extremely Unreliable Large Networks,
S. Nikoletseas and P. Spirakis
14:50 - 15:30 Coffee Break
15:30 - 15:55
Routing tree Problems on Random
Graphs,
C. Alvarez, R. Cases, J. Diaz, J. Petit and M. Serna
15:55 - 16:20
Efficient Automatic Simulation
of Parallel Computation on Networks of Workstations,
C. Kaklamanis, D. Krizanc, M. Montangero
and P. Persiano
16:20 - 16:45
Parallel Machine Scheduling
Problems with Controllable Processing Times,
K. Jansen and M. Mastrolilli
16:45 - 17:10
A Note on Parallel Read Operations
on Large Public Databases,
G. Bongiovanni, A. Clementi and
P. Penna
17:30
ARACNE Business Meeting