ARACNE 2000

Accepted Papers
  • The Complexity of Base Station Positioning in Cellular Networks,
    C. Glasser, S. Reith, H. Vollmer

  • Conversion of Coloring Algorithms into Maximum Weight Independent Set Algorithms,
    T. Erlebach and K. Jansen

  • Efficient Communication Establishment in Extremely Unreliable Large Networks,
    S. Nikoletseas and P. Spirakis

  • Coloring Circular Arcs with Applications to WDM Routing,
    A. Rescigno and L. Gargano

  • Routing tree problems on random graphs,
    C.Alvarez, R. Cases, J. Diaz, J. Petit, M. Serna

  • Experimental Evaluation of Approximation Algorithms for the Minimum Cost Multiple-source Unsplittable Flow Problem,
    Y. Asano

  • Wavelength Routing of Uniform Instances in Optical Rings,
    L. Narayanan, J. Opatrny

  • Efficient Automatic Simulation of Parallel Computation on Networks of Workstations,
    C. Kaklamanis, D. Krizanc, M. Montangero, P. Persiano

  • Parallel Machine Scheduling Problems with Controllable Processing Times,
    K. Jansen and M. Mastrolilli

  • Distributive online channel assignment for hexagonal cellular networks with constraints,
    S. Fitzpatrick, J. Janssen, R. Nowakowski

  • A Note on Parallel Read Operations on Large Public Databases,
    G. Bongiovanni , A. Clementi , P. Penna