Networks

Table of Contents

Volume 26 Issue 4 (December 1995)

fmi-fmi, 165-317

Masthead

Masthead

  • Author:
  • Pub Online: Oct 11, 2006
  • DOI: 10.1002/net.3230260401 (p fmi-fmi)

Articles

The intractability of the reliable assignment problem in split networks

  • Author: Constantine Stivaros, Klaus Sutner
  • Pub Online: Oct 11, 2006
  • DOI: 10.1002/net.3230260402 (p 165-172)

Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm

  • Author: Henrik Esbensen
  • Pub Online: Oct 11, 2006
  • DOI: 10.1002/net.3230260403 (p 173-185)

Reductions for the rectilinear steiner tree problem

  • Author: Pawel Winter
  • Pub Online: Oct 11, 2006
  • DOI: 10.1002/net.3230260404 (p 187-198)

Restricted simplicial decomposition with side constraints

  • Author: ÁNgel Marín
  • Pub Online: Oct 11, 2006
  • DOI: 10.1002/net.3230260405 (p 199-215)

Reliability analysis of tree‐based networks and its application to fault‐tolerant VLSI systems

  • Author: Marco Roccetti
  • Pub Online: Oct 11, 2006
  • DOI: 10.1002/net.3230260406 (p 217-230)

On the generalized minimum spanning tree problem

  • Author: Young‐Soo Myung, Chang‐Ho Lee, Dong‐Wan Tcha
  • Pub Online: Oct 11, 2006
  • DOI: 10.1002/net.3230260407 (p 231-241)

The pickup delivery location problem on networks

  • Author: Gur Mosheiov
  • Pub Online: Oct 11, 2006
  • DOI: 10.1002/net.3230260408 (p 243-251)

Multiple message broadcasting in communication networks

  • Author: Oh‐Heum Kwon, Kyung‐Yong Chwa
  • Pub Online: Oct 11, 2006
  • DOI: 10.1002/net.3230260409 (p 253-261)

The shortest path with at most / nodes in each of the series/parallel clusters

  • Author: Wen‐Jui Li, H.‐S. Jacob Tsao, Osman Ulular
  • Pub Online: Oct 11, 2006
  • DOI: 10.1002/net.3230260410 (p 263-271)

An O(N 2 ) heuristic for steiner minimal trees in E 3

  • Author: J. MacGregor Smith, Rich Weiss, Minoo Patel
  • Pub Online: Oct 11, 2006
  • DOI: 10.1002/net.3230260411 (p 273-289)

Encoding shortest paths in spatial networks

  • Author: Martin Erwig
  • Pub Online: Oct 11, 2006
  • DOI: 10.1002/net.3230260412 (p 291-303)

Computing the 2‐median on tree networks in O(n lg n) time

  • Author: Bezalel Gavish, Suresh Sridhar
  • Pub Online: Oct 11, 2006
  • DOI: 10.1002/net.3230260413 (p 305-317)

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.