Networks

Table of Contents

Volume 41 Issue 2 (March 2003)

73-125

Towards minimum k ‐geodetically connected graphs

  • Author: Ján Plesník
  • Pub Online: Dec 27, 2002
  • DOI: 10.1002/net.10060 (p 73-82)

Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3

  • Author: Jean‐Claude Bermond, Stephan Ceroi
  • Pub Online: Jan 27, 2003
  • DOI: 10.1002/net.10061 (p 83-86)

Reserving resilient capacity for a single commodity with upper‐bound constraints

  • Author: G. Brightwell, G. Oriolo, F. B. Shepherd
  • Pub Online: Jan 27, 2003
  • DOI: 10.1002/net.10064 (p 87-96)

An improved algorithm for the minmax regret median problem on a tree

  • Author: Igor Averbakh, Oded Berman
  • Pub Online: Jan 30, 2003
  • DOI: 10.1002/net.10062 (p 97-103)

A GRASP with path‐relinking for private virtual circuit routing

  • Author: Mauricio G. C. Resende, Celso C. Ribeiro
  • Pub Online: Feb 05, 2003
  • DOI: 10.1002/net.10065 (p 104-114)

A polynomial‐time algorithm to find shortest paths with recourse

  • Author: J. Scott Provan
  • Pub Online: Feb 05, 2003
  • DOI: 10.1002/net.10063 (p 115-125)

Related Topics

Related Publications

Related Content

Site Footer

Address:

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 StatisticsViews.com are checked for statistical accuracy by a panel from the European Network for Business and Industrial Statistics (ENBIS)   to whom Wiley and StatisticsViews.com 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.