Cover image for Networks

January 2005

Volume 45, Issue 1

Pages 1–48

    1. Solving the undirected minimum cost flow problem with arbitrary costs (pages 1–3)

      A. Sedeño-Noda, C. González-Martín and S. Alonso

      Article first published online: 3 NOV 2004 | DOI: 10.1002/net.20042

    2. Strict nonblockingness of reduced shuffle-exchange networks (pages 4–8)

      F. K. Hwang and Binwu Zhang

      Article first published online: 9 NOV 2004 | DOI: 10.1002/net.20043

    3. Parallel scheduling problems in next generation wireless networks (pages 9–22)

      L. Becchetti, S. Leonardi, A. Marchetti-Spaccamela, A. Vitaletti, S. Diggavi, S. Muthukrishnan and T. Nandagopal

      Article first published online: 9 NOV 2004 | DOI: 10.1002/net.20045

    4. Adversarial models for priority-based networks (pages 23–35)

      C. Àlvarez, M. Blesa, J. Díaz, M. Serna and A. Fernández

      Article first published online: 18 NOV 2004 | DOI: 10.1002/net.20044