default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 24
Volume 24, Number 1, January 1994
- Chang Sup Sung, Cheol Min Joo:
Locating an obnoxious facility on a euclidean network to minimize neighborhood damage. 1-9 - Matteo Fischetti, Horst W. Hamacher, Kurt Jørnsten, Francesco Maffioli:
Weighted k-cardinality trees: Complexity and polyhedral structure. 11-21 - Ornan Ori Gerstel, Shmuel Zaks:
A new characterization of tree medians with applications to distributed sorting. 23-29 - Oded Berman, Divinagracia I. Ingco, Amedeo R. Odoni:
Improving the location of minimax facilities through network modification. 31-41 - Randolph W. Hall
, Yafeng Du, Julia Lin:
Use of continuous approximations within discrete algorithms for routing vehicles: Experimental results and interpretation. 43-56
Volume 24, Number 2, March 1994
- J. David Fuller, B. Lan:
A fast algorithm for bounded generalized processing networks. 57-67 - Olivier Goldschmidt, Alexan Takvorian:
An efficient graph planarization two-phase heuristic. 69-73 - Marie-Claude Heydemann, J. C. Meyer, Dominique Sotteau, Jaroslav Opatrny:
Forwarding indices of consistent routings and their complexity. 75-82 - Ernest J. Cockayne, Christina M. Mynhardt, Bo Yu:
Universal minimal total dominating functions in graphs. 83-90 - Arvind Krishna, Bruce E. Hajek, Andrea Pietracaprina:
Sharper analysis of packet routing on a butterfly. 91-101 - Ding-Zhu Du, Frank K. Hwang, Andrew M. Odlyzko, Yanjun Zhang:
Minimal-distance routing for KYKLOS II. 103-108 - Jue Xue:
Edge-maximal triangulated subgraphs and heuristics for the maximum clique problem. 109-120
- Noel P. Greis:
Operations management: Strategy and analysis, by Lee J. Krajewski and L. P. Ritzman, Addison-Wesley, Reading, MA, 1987, 916 pp., Price: $43.95. 121 - Jack Yurkiewicz:
Computer models for management science, 3rd ed., by Warren Erikson and Owen Hall, Addison-Wesley, Reading, MA, 1989, 263 pp. 121-123 - Arthur W. Berger:
Queueing networks with blocking, edited by H. G. Perros and T. Altiok, North-Holland, Amsterdam, 1989, 358 pp. 123 - Moshe B. Rosenwein:
Discrete location theory, edited by P. B. Mirchandani and R. L. Francis, John Wiley & Sons, New York, 1990, 555 pp. 124-125 - David Madigan:
Graphical models in applied multivariate statistics, by J. Whittaker, John Wiley & Sons, New York, 1990, 448 pp. Price: $59.95. 125 - Edward R. Scheinerman:
Foundations of applied combinatorics, by Edward A. Bender and S. Gil Williamson, Addison-Wesley, Reading, MA, 1991, 425 pp. 125-126 - Thomas P. Capotosto:
Communications networks: A first course, by Jean Walrand, Irwin Inc. and Aksen Associates, Homewood, IL, 1991, 460 pp. Price: $52.95. 126 - Joseph S. Kaufman:
The art of computer systems performance analysis, by R. Jain, John Wiley & Sons. New York, 1991, 685 pp. 127
- Pierre L'Ecuyer:
Gradient estimation via perturbation analysis, by Paul Glasserman, Kluwer, Boston. MA, 1991, 221 pp. 127-128
- Shu-Cherng Fang, Sarat C. Puthenpura:
Numerical linear algebra and optimization-volume 1, by Philip E. Gill. Walter Murray, and Margaret H. Wright, Addison-Wesley, Redwood City, CA, 1991, 448 pp. Price: $46.25. 128-129 - Rubin Johnson:
The stable marriage problem: Structure and algorithms, by Dan Gusfield and Robert Irving, The MIT Press, Cambridge, MA, 1989, 240 pp., $27.50. 129-130
Volume 24, Number 3, May 1994
- Jon Lee, Jennifer Ryan:
Local bipartite turán graphs and graph partitioning. 131-145 - Konstantinos Kalpakis, Alan T. Sherman:
Probabilistic analysis of an enhanced partitioning algorithm for the steiner tree problem in Rd. 147-159 - Warren B. Powell, Raymond K.-M. Cheung:
Stochastic programs over trees with random arc capacities. 161-175 - Evelyne Flandrin, Hao Li:
Mengerian properties, hamiltonicity, and claw-free graphs. 177-183 - Thomas Kämpke:
A separation decomposition for orders. 185-194
Volume 24, Number 4, July 1994
- Daniel Bienstock, Oktay Günlük:
A degree sequence problem related to network design. 195-205 - Wayne Goddard:
Measures of vulnerability-the integrity family. 207-213 - John E. Beasley, F. Goffinet:
A delaunay triangulation-based heuristic for the euclidean steiner problem. 215-224 - James W. Boland, Richard D. Ringeisen:
On super i-connected graphs. 225-232 - Leizhen Cai, J. Mark Keil:
Spanners in graphs of bounded degree. 233-249 - Olivier Goldschmidt, Patrick Jaillet, Richard Lasota:
On reliability of graphs with node failures. 251-259 - Matteo Paris:
Note: The diameter of edge domination critical graphs. 261-262 - Ingo Althöfer:
Note: Small integral flows need only sparse networks. 263-266
Volume 24, Number 5, August 1994
- Ramjee P. Swaminathan:
A bad submatrix is easy to find. 267-271 - Wenceslas Fernandez de la Vega, Yannis Manoussakis:
Computation of the forwarding index via flows: A note. 273-276 - Guifang Wang:
A proof of Boesch's conjecture. 277-284 - Antoine Gautier, Frieda Granot:
Ripples, complements, and substitutes in singly constrained monotropic parametric network flow problems. 285-296 - Jane N. Hagstrom, Ray Hagstrom, Ross A. Overbeek, Morgan Price, Linus Schrage:
Maximum likelihood genetic sequence reconstruction from oligo content. 297-302
Volume 24, Number 6, September 1994
- Gen-Huey Chen, Dyi-Rong Duh:
Topological properties, communication, and computation on WK-recursive networks. 303-317 - John D. Carpinelli, A. Yavuz Oruç:
Applications of matching and edge-coloring algorithms to routing in clos networks. 319-326 - Zevi Miller, Ivan Hal Sudborough:
Compressing grids into small hypercubes. 327-357
Volume 24, Number 7, October 1994
- Michael J. Dinneen, Paul R. Hafner:
New results for the degree/diameter problem. 359-367 - Warren B. Powell, Raymond K.-M. Cheung:
A network recourse decomposition method for dynamic networks with random arc capacities. 369-384 - Yeroon van den Berg, David M. Panton:
Personnel shift assignment: Existence conditions and network models. 385-394 - Naoki Katoh, Kazuo Iwano:
Efficient algorithms for minimum range cut problems. 395-407
Volume 24, Number 8, December 1994
- Sivakumar Ravada, Alan T. Sherman:
Experimental evaluation of a partitioning algorithm for the steiner tree problem in R2 and R3. 409-415 - Piotr Berman, Andrzej Pelc:
Reliable distributed diagnosis for multiprocessor systems with random faults. 417-427 - Hideaki Harada, Zheng Sun, Hiroshi Nagamochi:
An exact lower bound on the number of cut-sets in multigraphs. 429-443 - Jeffrey L. Arthur, James O. Frendewey:
An algorithm for generating minimum cost network flow problems with specific structure and known optimal solutions. 445-454
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-04 00:45 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
