default search action
Networks, Volume 39
Volume 39, Number 1, January 2002
- Gary Chartrand, Frank Harary, Ping Zhang:
On the geodetic number of a graph. 1-6 - Maiko Shigeno:
Minimax inverse problems of minimum cuts. 7-14 - Nina K. Detlefsen, Stein W. Wallace:
The simplex algorithm for multicommodity networks. 15-28 - Corinne Feremans, Martine Labbé
, Gilbert Laporte:
A comparative analysis of several formulations for the generalized minimum spanning tree problem. 29-34 - Christian Fremuth-Paeger, Dieter Jungnickel:
Balanced network flows. VII. Primal-dual algorithms. 35-42 - Charu C. Aggarwal, James B. Orlin
On multiroute maximum flows in networks. 43-52 - Justin C. Williams:
A linear-size zero - one programming model for the minimum spanning tree problem in planar graphs. 53-60
Volume 39, Number 2, March 2002
- Daniela Ferrero
Partial line directed hypergraphs. 61-67 - Glenn K. Manacher, Terrance A. Mankus:
A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone. 68-72 - Paul L. Mariz, Shahriar Shahriari
Edge-cutsets in the directed hypercube. 73-76 - V. Venkata Rao, R. Sridharan:
Minimum-weight rooted not-necessarily-spanning arborescence problem. 77-87 - Anders Dessmark, Andrzej Pelc:
Deterministic radio broadcasting at low cost. 88-97 - Pierre Fraigniaud, Jean-Claude König, Emmanuel Lazard:
Oriented hypercubes. 98-106 - Paul McAree, Lawrence Bodin, Michael O. Ball:
Models for the design and analysis of a large package sort facility. 107-120
Volume 39, Number 3, May 2002
- Michael J. Dinneen
Degree- and time-constrained broadcast networks. 121-129 - Bang Ye Wu, Kun-Mao Chao
Light graphs with small routing cost. 130-138 - Richard L. Francis, Timothy J. Lowe, Arie Tamir:
Worst-case incremental analysis for a class of p-facility location problems. 139-143 - Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Mark Keil, David G. Kirkpatrick, Michael Segal
Efficient algorithms for centers and medians in interval and circular-arc graphs. 144-152 - Camino Balbuena, Josep Fàbrega
Superconnected digraphs and graphs with small conditional diameters. 153-160 - Matteo Fischetti, Giuseppe Lancia
Exact algorithms for minimum routing cost trees. 161-173
Volume 39, Number 4, July 2002
- Andrés Cano
Lazy evaluation in penniless propagation over join trees. 175-185 - Marcus Brazil
Forbidden subpaths for Steiner minimum networks in uniform orientation metrics. 186-202 - Yoshiyuki Karuno, Hiroshi Nagamochi, Toshihide Ibaraki:
Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks. 203-209 - Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Vahab S. Mirrokni:
Length-constrained path-matchings in graphs. 210-215 - Mikael Prytz, Anders Forsgren:
Dimensioning multicast-enabled communications networks. 216-231
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-01-13 00:52 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: