Table of Contents

Volume 43 Issue 2 (March 2004)


Minimal path broadcast networks

  • Author: Arthur M. Farley
  • Pub Online: Jan 15, 2004
  • DOI: 10.1002/net.10104 (p 61-70)

The generalized minimum spanning tree problem: Polyhedral analysis and branch‐and‐cut algorithm

  • Author: Corinne Feremans, Martine Labbé, Gilbert Laporte
  • Pub Online: Jan 15, 2004
  • DOI: 10.1002/net.10105 (p 71-86)

An exact algorithm for the min‐cost network containment problem

  • Author: Raffaele Pesenti, Franca Rinaldi, Walter Ukovich
  • Pub Online: Jan 15, 2004
  • DOI: 10.1002/net.10106 (p 87-102)

On some properties of suboptimal colorings of graphs

  • Author: Ivo Blöchliger, D. de Werra
  • Pub Online: Jan 15, 2004
  • DOI: 10.1002/net.10107 (p 103-108)

The absolute center of a network

  • Author: Dov Dvir, Gabriel Y. Handler
  • Pub Online: Jan 15, 2004
  • DOI: 10.1002/net.10108 (p 109-118)

A randomized algorithm for gossiping in radio networks

  • Author: Marek Chrobak, Leszek Ga̧sieniec, Wojciech Rytter
  • Pub Online: Jan 15, 2004
  • DOI: 10.1002/net.10109 (p 119-124)

Related Topics

Related Publications

Related Content

Site Footer


This website is provided by John Wiley & Sons Limited, The Atrium, Southern Gate, Chichester, West Sussex PO19 8SQ (Company No: 00641132, VAT No: 376766987)

Published features on are checked for statistical accuracy by a panel from the European Network for Business and Industrial Statistics (ENBIS)   to whom Wiley and express their gratitude. This panel are: Ron Kenett, David Steinberg, Shirley Coleman, Irena Ograjenšek, Fabrizio Ruggeri, Rainer Göb, Philippe Castagliola, Xavier Tort-Martorell, Bart De Ketelaere, Antonio Pievatolo, Martina Vandebroek, Lance Mitchell, Gilbert Saporta, Helmut Waldl and Stelios Psarakis.