default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 48
Volume 48, Number 1, August 2006
- Walid Ben-Ameur, Luis Eduardo Neves Gouveia
:
Further contributions to network optimization. 1-6 - Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia:
Route discovery with constant memory in oriented planar geometric networks. 7-15 - Rainer E. Burkard, Elisabeth Gassner, Johannes Hatzl:
A linear time algorithm for the reverse 1-median problem on a cycle. 16-23 - Fan Wang, Andrew Lim, Zhou Xu:
The one-commodity pickup and delivery travelling salesman problem on a path or a tree. 24-35 - Ethan D. Bolker, Thomas Zaslavsky:
A simple algorithm that proves half-integrality of bidirected network programming. 36-38 - Doreen A. Thomas, Jia F. Weng:
Minimum cost flow-dependent communication networks. 39-46 - Jeffrey H. Dinitz, Alan C. H. Ling, Douglas R. Stinson:
Fault-tolerant routings with minimum optical index. 47-55
Volume 48, Number 2, September 2006
- Hanif D. Sherali, Chawalit Jeenanunta, Antoine G. Hobeika:
The approach-dependent, time-dependent, label-constrained shortest path problem. 57-67 - Maren Martens, Martin Skutella:
Flows on few paths: Algorithms and lower bounds. 68-76 - Luis Eduardo Neves Gouveia, Pierre Pesneau:
On extended formulations for the precedence constrained asymmetric traveling salesman problem. 77-89 - Matthew S. Daly, Christos Alexopoulos:
State-space partition techniques for multiterminal flows in stochastic networks. 90-111
Volume 48, Number 3, October 2006
- Bruce L. Golden, Douglas R. Shier:
Editorial: 2005 Glover-Klingman prize winners. 113 - Camino Balbuena, Pedro García-Vázquez, Xavier Marcote:
Reliability of interconnection networks modeled by a product of graphs. 114-120 - Toru Araki:
Hyper hamiltonian laceability of Cayley graphs generated by transpositions. 121-124 - J. Reese:
Solution methods for the p-median problem: An annotated bibliography. 125-142 - Lawrence M. Leemis, Matthew J. Duggan, John H. Drew, Jeffrey A. Mallozzi, Kerry W. Connell:
Algorithms to calculate the distribution of the longest path length of a stochastic activity network with continuous activity durations. 143-165 - Pierre Fraigniaud, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc:
Collective tree exploration. 166-177
Volume 48, Number 4, December 2006
- Jun Shao, Zhenfu Cao, Rongxing Lu:
An improved deniable authentication protocol. 179-181 - G. A. Klunder, H. N. Post:
The shortest path problem on large-scale real-road networks. 182-194 - Maurizio Bruglieri, Francesco Maffioli, Marco Trubian:
Solving minimum K-cardinality cut problems in planar graphs. 195-208 - H. Edwin Romeijn, Dushyant Sharma, Robert L. Smith:
Extreme point characterizations for infinite network flow problems. 209-222 - Andreas S. Schulz, Nicolás E. Stier Moses:
Efficiency and fairness of system-optimal routing with user constraints. 223-234 - Cheng-Kuan Lin, Hua-Min Huang, D. Frank Hsu, Lih-Hsing Hsu:
On the spanning w-wide diameter of the star graph. 235-249
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 2024-10-23 20:20 CEST 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:
