default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 26
Volume 26, Number 1, August 1995
- Andrew B. Philpott
, Mark Craddock:
An adaptive discretization algorithm for a class of continuous network programs. 1-11 - Donald M. Topkis:
Repeated uncoordinated information dissemination by flooding. 13-23 - I-Ming Chao, Bruce L. Golden, Edward A. Wasil:
An improved heuristic for the period vehicle routing problem. 25-44 - Doowon Paik, Sartaj Sahni:
Network upgrading problems. 45-58
Volume 26, Number 2, September 1995
- Michael D. Grigoriadis, Leonid G. Khachiyan:
An exponential-function reduction method for block-angular convex programs. 59-68 - Anna Nagurney, Takashi Takayama, Ding Zhang:
Projected dynamical systems modeling and computation of spatial network equilibria. 69-85 - Arun K. Somani, Sanjay Thatte:
The helical cube network. 87-100 - Satyan R. Coorg, C. Pandu Rangan:
Feedback vertex set on cocomparability graphs. 101-111 - Matteo Fischetti, Juan José Salazar González, Paolo Toth:
The symmetric generalized traveling salesman polytope. 113-123
Volume 26, Number 3, October 1995
- Jean-Claude Bermond, Pierre Fraigniaud, Joseph G. Peters:
Antepenultimate broadcasting. 125-137 - Haitze J. Broersma, F. Göbel:
Bipartite regular graphs with fixed diameter. 139-144 - Stephen A. Wong:
Hamilton cycles and paths in butterfly graphs. 145-150 - Charles C. Palmer, Aaron Kershenbaum:
An approach to a problem in network design using genetic algorithms. 151-163
Volume 26, Number 4, December 1995
- Constantine Stivaros, Klaus Sutner:
The intractability of the reliable assignment problem in split networks. 165-172 - Henrik Esbensen:
Computing near-optimal solutions to the steiner problem in a graph using a genetic algorithm. 173-185 - Pawel Winter:
Reductions for the rectilinear steiner tree problem. 187-198 - Ángel Marín:
Restricted simplicial decomposition with side constraints. 199-215 - Marco Roccetti:
Reliability analysis of tree-based networks and its application to fault-tolerant VLSI systems. 217-230 - Young-Soo Myung, Chang-ho Lee, Dong-wan Tcha:
On the generalized minimum spanning tree problem. 231-241 - Gur Mosheiov:
The pickup delivery location problem on networks. 243-251 - Oh-Heum Kwon, Kyung-Yong Chwa:
Multiple message broadcasting in communication networks. 253-261 - Wen-Jui Li, H.-S. Jacob Tsao, Osman Ulular:
The shortest path with at most / nodes in each of the series/parallel clusters. 263-271 - J. MacGregor Smith, Richard S. Weiss, Minoo Patel:
An O(N2) heuristic for steiner minimal trees in E3. 273-289 - Martin Erwig:
Encoding shortest paths in spatial networks. 291-303 - Bezalel Gavish, Suresh Sridhar:
Computing the 2-median on tree networks in O(n lg n) time. 305-317
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-12-22 19:01 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:
