Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Networks AND Volume=26
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An adaptive discretization algorithm for a class of continuous network programs
Andrew B. Philpott
,
Mark Craddock
Networks
26
(1), 1995, pp. 1-11
Repeated uncoordinated information dissemination by flooding
Donald M. Topkis
Networks
26
(1), 1995, pp. 13-23
An improved heuristic for the period vehicle routing problem
I-Ming Chao
,
Bruce L. Golden
,
Edward Wasil
Networks
26
(1), 1995, pp. 25-44
Network upgrading problems
Doowon Paik
,
Sartaj Sahni
Networks
26
(1), 1995, pp. 45-58
An exponential-function reduction method for block-angular convex programs
Michael D. Grigoriadis
,
Leonid G. Khachiyan
Networks
26
(2), 1995, pp. 59-68
Projected dynamical systems modeling and computation of spatial network equilibria
Anna Nagurney
,
Takashi Takayama
,
Ding Zhang
Networks
26
(2), 1995, pp. 69-85
The helical cube network
Arun K. Somani
,
Sanjay Thatte
Networks
26
(2), 1995, pp. 87-100
Feedback vertex set on cocomparability graphs
Satyan R. Coorg
,
C. Pandu Rangan
Networks
26
(2), 1995, pp. 101-111
The symmetric generalized Traveling Salesman polytope
Matteo Fischetti
,
Juan José Salazar González
,
Paolo Toth
Networks
26
(2), 1995, pp. 113-123
Antepenultimate broadcasting
Jean-Claude Bermond
,
Pierre Fraigniaud
,
Joseph G. Peters
Networks
26
(3), 1995, pp. 125-137
Bipartite regular graphs with fixed diameter
H.J. Broersma
,
F. Göbel
Networks
26
(3), 1995, pp. 139-144
Hamilton cycles and paths in butterfly graphs
Stephen A. Wong
Networks
26
(3), 1995, pp. 145-150
An approach to a proablem in network design using genetic algorithms
Charles C. Palmer
,
Aaron Kershenbaum
Networks
26
(3), 1995, pp. 151-163
The intractability of the reliable assignment problem in split networks
Constantine Stivaros
,
Klaus Sutner
Networks
26
(4), 1995, pp. 165-172
Computing near-optimal solutions to the Steiner problem in a graph using a genetic algorithm
Henrik Esbensen
Networks
26
(4), 1995, pp. 173-185
Reductions for the rectilinear Steiner tree problem
Pawel Winter
Networks
26
(4), 1995, pp. 187-198
Restricted simplicial decomposition with side constraints
Ángel Marín
Networks
26
(4), 1995, pp. 199-215
Reliability analysis of tree-based networks and its application to fault-tolerant VLSI systems
Marco Roccetti
Networks
26
(4), 1995, pp. 217-230
On the generalized minimum spanning tree problem
Young-Soo Myung
,
Chang-Ho Lee
,
Dong-Wan Tcha
Networks
26
(4), 1995, pp. 231-241
The pickup delivery location problem on networks
Gur Mosheiov
Networks
26
(4), 1995, pp. 243-251
Multiple message broadcasting in communication networks
Oh-Heum Kwon
,
Kyung-Yong Chwa
Networks
26
(4), 1995, pp. 253-261
The shortest path with at most
I
nodes in each of the series/parallel clusters
Wen-Jui Li
,
H.-S. Jacob Tsao
,
Osman Ulular
Networks
26
(4), 1995, pp. 263-271
An
O(N^2)
heuristic for Steiner minimal trees in
E^3
J. MacGregor Smith
,
Rich Weiss
,
Minoo Patel
Networks
26
(4), 1995, pp. 273-289
Encoding shortest paths in spatial networks
Martin Erwig
Networks
26
(4), 1995, pp. 291-303
Computing the 2-median on tree networks in
O(n \log n)
time
Bezalel Gavish
,
Suresh Sridhar
Networks
26
(4), 1995, pp. 305-317