Networks, Volume 38

Volume 38, Number 1, August 2001

• Frank K. Hwang, Chih-Hung Yen:
  Characterizing the bit permutation networks obtained from the line digraphs of bit permutation networks. 1-5
  
• Shiwoo Lee, Jose A. Ventura:
  An algorithm for constructing minimal c-broadcast networks. 6-21
  
• Gianluca Dini:
  Electronic voting in a large-scale distributed system. 22-32
  
• Gary Chartrand, Karen S. Novotny, Steven J. Winters:
  The ultracenter and central fringe of a graph. 33-38
  
• Luisa Gargano, Andrzej Pelc, Stephane Perennes, Ugo Vaccaro:
  Efficient communication in unknown networks. 39-49
  
• S. A. Canuto, Mauricio G. C. Resende, Celso C. Ribeiro:
  Local search with perturbations for the prize-collecting Steiner tree problem in graphs. 50-58
  

Volume 38, Number 2, September 2001

• Thomas Andreae:
  On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality. 59-67
  
• J. H. Rubinstein, D. A. Thomas, Nicholas C. Wormald:
  A polynomial algorithm for a constrained traveling salesman problem. 68-75
  
• Martin Zachariasen:
  A catalog of Hanan grid problems. 76-83
  
• Fred R. McMorris, Fred S. Roberts, Chi Wang:
  The center function on trees. 84-87
  
• Massimiliano Caramia, Paolo Dell'Olmo:
  Solving the minimum-weighted coloring problem. 88-101
  
• Rainer E. Burkard, Helidon Dollani:
  Robust location problems with pos/neg weights on a tree. 102-113
  

Volume 38, Number 3, October 2001

• Lisa Fleischer:
  Universally maximum flow with piecewise-constant capacities. 115-125
  
• Ulrich Brenner, Jens Vygen:
  Worst-case ratios of networks in the rectilinear plane. 126-139
  
• Jeong-dong Ryoo, Shivendra S. Panwar:
  File distribution in networks with multimedia storage servers. 140-149
  
• Pierre Fraigniaud, Joseph G. Peters:
  Minimum linear gossip graphs and maximal linear (Delta, k)-gossip graphs. 150-162
  
• Hovhannes A. Harutyunyan, Arthur L. Liestman:
  k-Broadcasting in trees. 163-168
  

Volume 38, Number 4, December 2001

• Ananth V. Iyer, Jianming Ye:
  A network based model of a promotion-sensitive grocery logistics system. 169-18
  
• Richard D. McBride, John W. Mamer:
  Solving the undirected multicommodity flow problem using a shortest path-based pricing algorithm. 181-188
  
• Amir Averbuch, Iris Gaber, Yehuda Roditty:
  Low-cost minimum-time line-broadcasting schemes in complete binary trees. 189-193
  
• Yash P. Aneja, R. Chandrasekaran, Kunhiraman Nair:
  Maximizing residual flow under an arc destruction. 194-198
  
• Shimon Even:
  Area efficient layouts of the Batcher sorting networks. 199-208
  
• Maarten Oosten, Jeroen H. G. C. Rutten, Frits C. R. Spieksma:
  The clique partitioning problem: Facets and patching facets. 209-226