Table Of Content

HETWIMS AN INTERNATIONAL JOURNAL Author Index to Volume 34, 1999 Anazawa. T., Kodera, T., and Jimbo, M.: Optimum Requirement Spanning Hakimi, S. L., Labbe, M., and Schmeichel, E. F.: Locations on Time- Trees and Reliability of Tree Networks. I22 Varying Networks. 250 Anazawa. T.: On a Condition for Obtaining an Explicit Solution of Opti¬ Hartvigsen, D.: see Easley, R. F. mum Requirement Spanning Tree. 132 Havill. J. T., and Mao, W.: Greedy Online Algorithms for Routing Per¬ manent Virtual Circuits, 136 Balbuena. C.; see Gomez. J. Henning. M. A.: see Dankelmann. P. Bertsimas. D., Teo. C-P., and Vohra. R.: Analysis of LP Relaxations for Multiway and Multicut Problems. 102 Jimbo, M.: see Anazawa. T. Bettayeb, S.: see Kulasinghe. P. D. Buckley, F.; Preface, 243 Kameda. T.: see Yamashita. M. Kate, M.: see Dolev, S. Carmona. A., and Fabrega. J.: On the Superconnectivity and the Condi¬ Klemm, K., and Winters, S. J.: Roperties of Edge-Deleted Distance Stable tional Diameter of Graphs and Digraphs, 197 Graphs, 279 Chang, M-S., Peng, S-L., Liaw, J-L.: Deferred-Query: An Efficient Ap¬ Kodera, T.: see Anazawa, T. proach for Some Problems on Interval Graphs, I Kranakis. E., Peic, A., and Spatharis, A.: Optimal Adaptive Fault Diagno¬ Chartrand. G., Gu, W., Schultz. M., and Winters, S. J.; Eccentric Graphs, sis for Simple Multiprocessor Systems, 206 IIS Krishnamoorthy, M.: see Ernst, A. Choudum. S. A., and Priya, N.: Tenacity of Complete Graph Products and Kulasinghe, P. D., and Bettayeb, S.: An Optimal Algorithm for Layered Grids, 192 Wheel Floorplan Designs, 67 Christofides, N.: .see Hadjiconstantinou, E. Labbe. M.: see Hakimi, S. L. Dankelmann, P., Goddard. W.. Henning, M. A., and Swart, H. C.: Gener¬ Laporte, G.: see Ghiani, G. alized Eccentricity, Radius, and Diameter in Graphs, 3I2 Larochelle, J-F.: see Gendreau. M. Dolev, S., Kate, M., and Welch. J. L.: A Competitive Analysis for Re- Le. H-0., and Le, V. B.: Optimal Tree 3-Spanners in Directed Path Graphs. transmi.ssion Timeout, 73 8I Duin, C., and VoB, S.: The Pilot Method: A Strategy for Heuristic Repe¬ Le. V. B.: see Le, H-O. tition with Application to the Steiner Problem in Graphs. 181 Liaw, J-L.: Chang, M-S. Easley, R. F., and Hartvigsen, D.: Crossing Properties of Multiterminal Mao. W.: see Havill. J. T. Cuts. 215 Moran, S.: see Eilam. T. Eilam, T., Moran, S., and Zaks, S.: Lower Bounds for Linear Interval Routing, 37 Nickel. S., and Puerto, J.: A Unified Approach to Network Location Ernst, A. T., Kri.shnamoorthy, M., and Storer, R. H.: Heuristic and Exact Problems, 283 Algorithms for Scheduling Aircraft Landings, 229 Nieminen, J., and Peltola. M.: The Subtree Center of a Tree, 272 Escudero, M.: see Gomez, J. Oellermann. O. R.: On Steiner Centers and Steiner Medians of Graphs, 258 Fabrega. J.: see Carmona, A. Rammini. M.: Deadlock-Free Interval Routing Schemes, 47 Pelayo. I.: see Gomez, J. PeIc, A.: see Kranakis. E. Garfinkel, R. S., and Webb, I. R.: On Crossings, the Crossing Postman Peltola, M.: see Nieminen. J. Problem, and the Rural Postman Problem, 173 Peng, S-L.: Chang, M-S. Gendreau, M., Larochelle, J-F., Sanso, B.: A Tabu Search Heuri.stic for the Priya. N.: see Choudum. S. A. Steiner Tree Problem, 162 Puerto, J.: see Nickel, S. Ghiani, G., and Laporte, G.: Eulerian Location Problems. 291 Goddard. W.: see Dankelmann, P. Ravi, S. S.: see Tayi, G. K. Gomez. J., and Escudero. M.: Optimal Edge Coloring of Large Graphs, 6I Reid, K. B.: Balance Vertices in Trees. 264 Gomez, J., Pelayo, L, and Balbuena. C.: New Large Graphs with Given Rosenkrantz, D. J.: see Tayi, G. K. Degree and Diameter Six, 154 Gu, W.: see Chartrand. G. Sanso, B.: see Gendreau. M. Schmeichel. E. F.: .see Hakimi, S. L. Hadjiconstantinou, E., and Christofides, N.: An Efficient Implementation Schultz, M.: see Chartrand, G. of an Algorithm for Finding K Shortest Simple Paths, 88 Segall. A.: see Shabtay, L. NETWORKS, VOL. 34, (1999) 323 324 AUTHOR INDEX Shabtay, L., and Segall, A.: On the Memory Overhead of Distributed VoB, S.: see Duin, C. Snapshots, 11 Vohra, R.: see Bertsimas, D. Slater, P. J.: A Survey of Sequences of Central Subgraphs, 244 Slater, P. J.; see Smart, C. Webb, I. R.: see Garfinkel, R. S. Smart, C., and Slater, P. J.: Center, Median, and Centroid Subgraphs, 303 Welch, J. L.: see Dolev, S. Spatharis, A.; see Kranakis, E. Winters, S. J.; see Chartrand, G.; see Klemm, K. Storer, R. H.: see Ernst, A. Swart, H. C.: see Dankelmann, P. Yamashita, M., and Kameda, T.; Modeling k-Coteries by Well- Covered Tayi, G. K., Rosenkrantz, D. J., and Ravi, S. S.; Path Problems in Networks Graphs, 221 with Vector-Valued Edge Weights, 19 Teo, C-P.; see Bertsimas, D. Zaks, S.: see Eilam, T. liTWIlKS AN INTERNATIONAL JOURNAL Subject Index to Volume 34, 1999 Acyclic orientation coverings, 47 Dynamic networks Aircraft landing, scheduling. 229 locations on, 250 Aircraft landing problem. 229 path selection problem, 250 Algorithms branch-and-bound, 229 Eccentricity, 1I5 branch-and-cut. 291 generalized, 312 finding K shortest simple paths, 88 Edge coloring, large graphs, 61 Gomory-Hu, 132 Edge-deleted distance stable graphs. 279 graphs. I Edge-superconnectivity, 197 greedy, I, 136 Edge weights, vector-valued, 19 KSP, 88 Eulerian location problems, 291 layered wheel floorplan designs, 67 on-line versus off-line, 73 simplex, 229 Fault diagnosis, adaptive, 206 tabu search. 162 Feasibility problems, vector-valued edge weights, 19 Arc routing, 291 Floorplan, layered wheel, 67 Asynchronous pacer protocol, 11 Average-set-eccentricity, 312 Girth, 197 Gomory-Hu algorithm, 132 Balance vertices, trees, 264 Graph products, tenacity, 192 Bipartite digraphs, superconnectivity, 197 Graphs Bipartitions, balanced, 264 algorithms, 1 Branch-and-bound algorithm, aircraft landing. 229 cactus, 37 Branch-and-cut algorithm, Eulerian location problems. 291 Cartesian products. 47 conditional diameter, 197 Cactus graphs. 37 directed, 81, 197 Cartesian products, graphs, 47 eccentric, 115 Center edge-deleted distance stable, 279 subgraphs. 303 finding K shortest simple paths, 88 tree. 272 generalized eccentricity, radius, and diameter, 312 Centrality measures, 244 interval, 1, 81 Centroid large, given degree and diameter six, 154 subgraphs. 303 lithium, 37 tree, 272 noncrossing cuts, 215 Centroid criterion, 244 optimal edge coloring. 61 Chordal rings, interval routing, 47 Steiner tree problem. 162 Chromatic index, 61 superconnectivity, 197 Competitive analysis, retransmission timeout, 73 tree r-spanner, 81 Compound graphs, 61 well-covered, 221 Constructive base heuristic, 229 Greedy algorithm, 1 Crossings, 173 online, 136 multiterminal cuts. 2I5 Grids, tenacity. 192 Cross postman problem, 173 Cuts, multiterminal. 215 Hamiltonian circuit. I Hamiltonian path. 1 Diameter, 3I2 conditional, graphs and digraphs, 197 Interconnection networks, edge coloring, 61 Digraphs Interval routing conditional diameter, 197 deadlock-free, 47 superconnectivity, 197 linear, 37 Diversification. 162 Domatic partition problem, I Dynamic I-median problem, 250 Joinsemilattice of subtrees, 272 NETWORKS, VOL. 34, (1999) 325 326 SUBJECT INDEX /t-coteries, modeling, 221 Rings it-interval labeling schemes, 47 adaptive diagnosis, 206 ^-mutual exclusion, 221 chordal, 47 KSP algorithm, 88 Routing problems, vector-valued edge weights, 19 Rural postman problem, 291 Least L-eccentricity, points, 272 undirected network, 173 Linear interval routing, lower bounds, 37 Lithium graphs, 37 Simplex algorithm, 229 Location routing, 291 Single-facility location problem, 283 Location theory, 283 Snapshots, distributed, 11 LP relaxation, 102 Spanning tree, 81 optimum requirement, 122, 132 Machine job scheduling, 229 Steiner center for graphs, 258 Maximum matching problems, I Steiner distance, 258 Median Steiner eccentricity of vertices, 258 criterion, 244 Steiner median of graphs, 258 subgraphs, 303 Steiner problem in graphs, 181 Memory, overhead, distributed snapshots, 11 Steiner tree Min-average cost path, 19 heuristics, 181 Minimum imbalance cost path, 19 tabu search heuristic, 162 Min-set-eccentricity, 312 Subgraphs Morre bipartite diameter 6 graph, 154 center, median, and centroid, 303 Multicut problems, 102 central, sequences, 244 Multiple runway problem, 229 eccentric, 115 Multiprocessors, adaptive fault diagnosis, 206 Subtrees, least central, 272 Multiway problems, 102 Superconnectivity, graphs and digraphs, 197 Network location problems, unified approach, 283 Tabu search algorithm, 162 Tenacity, graph products and grids, 192 Obnoxious route selection, 250 Time-varying networks, locations on, 250 Optimal path cover problem, I Optimum requirement spanning tree, 122, 132 Tori, adaptive diagnosis, 206 Ordered median problem, 283 Traveling salesman problem, 181 Orientation optimization problem, layered wheel floorplan, 67 Tree adaptive diagnosis, 206 balance vertices, 264 Packet radio networks, 61 Periphery, 115 central subgraph sequences, 244 Pilot method, 181 reliability, 122 Problem space search heuristic, 229 subtree center, 272 Tree t-spanner, 81 Radius, 312 Randomized rounding, 102 Vertex, 192 Reliability, tree networks, 122 edge-deleted distance stable, 279 Retransmission timeout, 73 Virtual circuits, routing, 136 I