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=52
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A reach and bound algorithm for acyclic dynamic-programming networks
Matthew D. Bailey
,
Robert L. Smith
,
Jeffrey M. Alden
Networks
52
(1), 2008, pp. 1-7
Spectral bounds for the maximum cut problem
Walid Ben-Ameur
,
José Neto
Networks
52
(1), 2008, pp. 8-13
A simplex algorithm for minimum-cost network-flow problems in infinite networks
Thomas C. Sharkey
,
H. Edwin Romeijn
Networks
52
(1), 2008, pp. 14-31
The computational complexity of graph contractions II: Two tough polynomially solvable cases
Asaf Levin
,
Daniel Paulusma
,
Gerhard J. Woeginger
Networks
52
(1), 2008, pp. 32-56
Analysis and computational study of several integer programming formulations for minimum-energy multicasting in wireless ad hoc networks
Joanna Bauer
,
Dag Haugland
,
Di Yuan
Networks
52
(2), 2008, pp. 57-68
The number of spanning trees in a class of double fixed-step loop networks
Xuerong Yong
,
Yuanping Zhang
,
Mordecai J. Golin
Networks
52
(2), 2008, pp. 69-77
On super connectivity of Cartesian product graphs
Min Lü
,
Chao Wu
,
Guo-Liang Chen
,
Cheng Lv
Networks
52
(2), 2008, pp. 78-87
Minimum work paths in elevated networks
Takeshi Shirabe
Networks
52
(2), 2008, pp. 88-97
Exact algorithms for the master ring problem
Hadas Shachnai
,
Lisa Zhang
,
Tomomi Matsui
Networks
52
(2), 2008, pp. 98-107
Minimizing a stochastic maximum-reliability path
Feng Pan
,
David P. Morton
Networks
52
(3), 2008, pp. 111-119
Reformulation and sampling to solve a stochastic network interdiction problem
Udom Janjarassuk
,
Jeff Linderoth
Networks
52
(3), 2008, pp. 120-132
Shortest path network interdiction with asymmetric information
Halil Bayrak
,
Matthew D. Bailey
Networks
52
(3), 2008, pp. 133-140
Price competition with elastic traffic
Asuman Ozdaglar
Networks
52
(3), 2008, pp. 141-155
Network search games, with arbitrary searcher starting point
Arnon Dagan
,
Shmuel Gal
Networks
52
(3), 2008, pp. 156-161
Hide-and-seek games on a tree to which Eulerian networks are attached
Steve Alpern
Networks
52
(3), 2008, pp. 162-166
Decontamination of hypercubes by mobile agents
Paola Flocchini
,
Miao Jun Huang
,
Flaminia L. Luccio
Networks
52
(3), 2008, pp. 167-178
On the diameter of the generalized undirected de Bruiin graphs
UG_B(n,m),n^2,<m\leq n^3
Jyhmin Kuo
,
Hung-Lin Fu
Networks
52
(4), 2008, pp. 180-182
On the hardness of range assignment problems
Bernhard Fuchs
Networks
52
(4), 2008, pp. 183-195
Conditional diameter saturated graphs
C. Balbuena
,
P. García-Vázquez
,
X. Marcote
,
J.C. Valenzuela
Networks
52
(4), 2008, pp. 196-201
Reliability of interconnection networks modeled by Cartesian product digraphs
Chao Yang
,
Jun-Ming Xu
Networks
52
(4), 2008, pp. 202-205
Valid cycles: A source of infeasibility in open shortest path first routing
Peter Broström
,
Kaj Holmberg
Networks
52
(4), 2008, pp. 206-215
Approximation bounds for Black Hole Search problems
Ralf Klasing
,
Euripides Markou
,
Tomasz Radzik
,
Fabiano Sarracco
Networks
52
(4), 2008, pp. 216-226
A linear programming approach to increasing the weight of all minimum spanning trees
Mourad Baïou
,
Francisco Barahona
Networks
52
(4), 2008, pp. 227-234
Competitive algorithms and lower bounds for online randomized call control in cellular networks
Ioannis Caragiannis
,
Christos Kaklamanis
,
Evi Papaioannou
Networks
52
(4), 2008, pp. 235-251
Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles
Dieter Rautenbach
,
Lutz Volkmann
Networks
52
(4), 2008, pp. 252-255
Seiten 1
2
>