Table Of Content

NETWORKS An International Journal Author Index to Volume 39, 2002 Aggarwal, C. C., and Orlin, J. B.: On Multiroute Maximum Flows Hajiaghayi, M. T.: see Ghodsi, M. in Networks, 43 Harary, F.; see Chartrand. G. Balbuena, C., Fabrega, J., Mareote, X., and Pelayo, 1.: Supercon- Ibaraki, T.; see Karuno, Y. neeted Digraphs and Graphs with Small Conditional Diameters, 153 Jungnickel, D.; see Fremuth-Paeger, C. Ball, M.: see McAree, P. Bespamyatnikh, S., Bhattacharya, B., Keil, M., Kirkpatrick, D., Karuno, Y., Nagamochi. H., and Ibaraki, T.: Better Approximation and Segal, M.: Efficient Algorithms for Centers and Medians in Rations for the Single-Vehicle Scheduling Problems on Line- Interval and Circular-Arc Graphs, 144 Shaped Networks, 203 Bhattacharya, B.: see Bespamyatnikh, S. Keil, M.: see Bespamyatnikh. S. Bodin, L.: see McAree, P. Kirkpatrick, D.: see Bespamyatnikh. S. Brazil, M., Thomas, D. A., and Weng, J. F.: Forbidden Subpaths Konig, J.-C.: see Fraigniaud. P. for Steiner Minimum Networks in Uniform Orientation Metrics, 186 Labbe. M.: see Feremans, C. Lancia, G.: see Fischetti, M. Cano, A., Moral, S., and Salmerdn, A.: Lazy Evaluation in Pen¬ Laporte. G.: see Feremans. C. niless Propagation over Join Trees. 175 Lazard, E.: see Fraigniaud. P. Chao, K.-M.; see Wu, B. Y. Lowe, T. J.; see Francis, R. L. Chartrand G., Harary, F., and Zhang, P.; On the Geodetic Number of a Graph, 1 Mahdian, M.: see Ghodsi. M. Manacher, G. K., and Mankus. T. A.: A Simple Linear Time Dessmark, A., and Pelc, A.: Deterministic Radio Broadcasting at Algorithm for Finding a Maximum Independent Set of Circular Low Cost, 88 Arcs Using Intervals Alone, 68 Detlefsen, N. K., and Wallace, S. W.; The Simplex Algorithm for Mankus, T. A.; see Manacher, G. K. Multicommodity Networks, 15 Mareote, X.: see Balbuena, C. Dinneen, M. J., Pritchard, G., and Wilson, M. C.: Degree- and Mariz. P. L., and Shahriari. S.: Edge-Cutsets in Directed Hyper¬ Time-Constrained Broadcast Networks, 121 cube, 73 McAree. P.. Bodin, L.. and Ball. M.: Models for the Design and Fabrega, J.: see Balbuena, C. Analysis of a Large Package Sort Facility. 107 Feremans, C., Labbe, M., and Laporte, G.: A Comparative Anal¬ Mirrokni, V. S.: see Ghodsi, M. ysis of Several Formulations for the Generalized Minimum Moral. S.: see Cano, A. Spanning Tree Problem, 29 Ferrero, D., and Padro, C.; Partial Line Directed Hypergraphs, 61 Nagamochi. H.; see Karuno. Y. Fischetti, M., Lancia, G., and Seratini, P.; Exact Algorithms for Minimum Routing Cost Trees, 161 Orlin, J. B.: see Aggarwal. C. C. Forsgren, A.: see Prytz, M. Fraigniaud, P., Konig, J.-C., and Lazard, E.; Oriented Hypercubes, Padro, C.: see Ferrero, D. 98 Pelayo. L: see Balbuena, C. Francis, R. L., Lowe, T. J., and Tamir, A.; Worst-Case Incremental Pelc. A.: see Dessmark. A. Analysis for a Class of p-Facility Location Problems, 139 Pritchard, G.: see Dinneen, M. J. Fremuth-Paeger, C., and Jungnickel, D.: Balanced Network Flows. Prytz, M., and Forsgren. A.; Dimensioning Multicast-Enabled Vll. Primal-Dual Algorithms. 35 Communications Networks. 216 Ghodsi, M., Hajiaghayi, M. T., Mahdian. M., and Mirrokni. V. S.: Rao. V. V., and Sridharan. R.: Minimum-Weight Rooted Not- Length-Constrained Path-Matchings in Graphs, 210 Necessarily-Spanning Arborescence Problem. 77 Salmerdn. A.: see Cano, A. © 2(M)2 Wiley Periodicals. Inc. Segal, M.: see Bespamyatnikh, S. NETWORKS—2002 235 Serafini. P.: see Fischetti, M. Wallace, S. W.; see Detlefsen, N. K. Shahriari. S.: see Mariz, P. L. Weng, J. F.: see Brazil, M. Shigeno, M.: Minimax Inverse Problems of Minimum Cuts, 7 Williams, J. C.; A Linear-Size Zero—One Programming Model Sridharan, R.: see Rao, V. V. for the Minimum Spanning Tree Problem in Planar Graphs, 53 Wilson, M. C.: see Dinneen, M. J. Wu, B. Y., Chao, K.-M., and Tang, C. Y.: Light Graphs with Small Tamir, A.: see Francis, R. L. Routing Cost, 130 Tang, C. Y.: see Wu, B. Y. Thomas, D. A.: see Brazil, M. Zhang, P.: see Chartrand, G. 236 NETWORKS—2002 NETWORKS An International Journal Subject Index to Volume 39, 2002 Acyclic graph, 77 Heuristic, 77 Aggregation, 139 Heuristic algorithms, 107 Algorithms, 210 Hypercube. 73, 98 Approximate algorithms, 130, 203 Arborescence, 77 Incremental analysis, 139 Independent set. 68 Basis characterization, 13 Integer linear programming. 29 Basis interpretation, 13 Interconnection networks, 61 Bayesian networks, 173 Interval and circular-arc graphs. 1-14 /^-matching problems, 33 Inverse optimization, 7 Boolean lattice, 73 Bounded degree, 121 Join trees, 173 Branch and price, 161 Branch-and-cut, 216 Lagrangian decomposition. 216 Broadcast networks. 121 Lagrangian relaxation. 77 Broadcasting, 88. 98 Lazy evaluation, 173 Bus networks, 61 Location. 139 Capacitated matching problems. 33 Matching, 210 Cayley graphs, 121 Maximum flows. 43 Circular arcs, 68 Maximum mean cut. 7 Computational biology, 161 Minimum spanning tree. 33 Connectivity. 61, 133 Minimum-cut problem, 7 Cost. 88 Mixed integer programs. 107 Multi-cast trafflc. 216 Diameter, 121, 133 Multicommodity, 13 Digraphs, 133 Multiroute flows. 43 Directed hypergraphs. 61 Distance, 1 Network design. 130, 161 Distributed, 88 Network flows. 33. 43 Network optimization. 216 Edge-cutsets, 73 NP-completeness. 210 Edge-disjoint chains. 73 NP-hard, 77 Expandability. 61 Oriented diameter, 98 Faculty design. 107 Fault-tolerance. 133 Parallel architecture, 98 Fixed charge problems, 107 Parametric search. 7 Fixed orientations, 186 Path-matching. 210 /^-centers, 144 Penniless propagation. 173 Geodetic number. 1 Performance guarantee. 203 Geodetic set. 1 Planar graphs, 33 />-median, 139 /^-medians. 144 Geodetic subgraph. I Polytopes, 29 Girth. 121, 133 Primal-dual algorithm. 33 Graph orientation, 98 Pseudo-matching. 210 Radio network. 88 © 2(K)2 Wiley Periodicals. Inc. Routing and scheduling. 203 NETWORKS—2002 237 Shortest path problems. 35 Variational method. 186 Simplex algorithm. 15 VLSI design. 186 Spanning trees. 29. 130 Steiner tree. 186 Superconnectivity. 153 Worst case. 139 Worst-case analysis. 203 Telecommunications. 216 Time. 88 Zero-one integer programming. 77 Uncapacitated plant location. 77 Zero-one programming, 53 238 NETWORKS—2002