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 YEAR=2012
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Models and heuristics for the
k
-degree constrained minimum spanning tree problem with node-degree costs
Christophe Duhamel
,
Luís Gouveia
,
Pedro Moura
,
Maurício de Souza
Networks
60
(1), 2012, pp. 1-18
Large neighborhood search for the pickup and delivery Traveling Salesman problem with multiple stacks
Jean-François Côté
,
Michel Gendreau
,
Jean-Yves Potvin
Networks
60
(1), 2012, pp. 19-30
On Stackelberg pricing with computationally bounded customers
Patrick Briest
,
Luciano Gualà
,
Martin Hoefer
,
Carmine Ventre
Networks
60
(1), 2012, pp. 31-44
Deception tactics for network interdiction: A multiobjective approach
Javier Salmerón
Networks
60
(1), 2012, pp. 45-58
Completely independent spanning trees in torus networks
Toru Hasunuma
,
Chie Morisaka
Networks
60
(1), 2012, pp. 59-69
A model of self-avoiding random walks for searching complex networks
Víctor M. López Millán
,
Vicent Cholvi
,
Luis López
,
Antonio Fernández Anta
Networks
60
(2), 2012, pp. 71-85
Constructing optimal subnetworks for the crossed cube network
Dajin Wang
Networks
60
(2), 2012, pp. 86-93
The
l_p
-function on trees
F.R. McMorris
,
Henry Martyn Mulder
,
O. Ortega
Networks
60
(2), 2012, pp. 94-102
Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs
Siqian Shen
,
J. Cole Smith
Networks
60
(2), 2012, pp. 103-119
Margining option portfolios by network flows
Dmytro Matsypura
,
Vadim G. Timkovsky
Networks
60
(2), 2012, pp. 120-131
Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty
Ayşegül Altin
,
B. Fortz
,
Hakan Ümit
Networks
60
(2), 2012, pp. 132-139
Column generation algorithm for sensor coverage scheduling under bandwidth constraints
André Rossi
,
Alok Singh
,
Marc Sevaux
Networks
60
(3), 2012, pp. 141-154
Integer models and upper bounds for the 3-club problem
Maria Teresa Almeida
,
Filipa D. Carvalho
Networks
60
(3), 2012, pp. 155-166
Property
P_{d,m}
and efficient design of reliable networks
Ralph J. Faudree
,
Ronald J. Gould
,
Jeffrey S. Powell
Networks
60
(3), 2012, pp. 167-178
A fast heuristic approach for large-scale cell-transmission-based evacuation route planning
A. Kimms
,
K.-C. Maassen
Networks
60
(3), 2012, pp. 179-193
Bottleneck links, variable demand, and the tragedy of the commons
Richard Cole
,
Yevgeniy Dodis
,
Tim Roughgarden
Networks
60
(3), 2012, pp. 194-203
Connectedness of finite distance graphs
Domingo Gómez-Pérez
,
Jaime Gutierrez
,
Álvar Ibeas
Networks
60
(3), 2012, pp. 204-209
A branch-and-cut algorithm for the pickup and delivery Traveling Salesman problem with multiple stacks
Jean-François Côté
,
Claudia Archetti
,
Maria Grazia Speranza
,
Michel Gendreau
,
Jean-Yves Potvin
Networks
60
(4), 2012, pp. 212-226
Simple linear flow decomposition algorithms on trees, circles, and augmented trees
Balachandran Vaidyanathan
Networks
60
(4), 2012, pp. 227-234
Distributed tree comparison with nodes of limited memory
Emanuele G. Fusco
,
Andrzej Pelc
Networks
60
(4), 2012, pp. 235-244
Approximating survivable networks with minimum number of Steiner points
Lior Kamma
,
Zeev Nutov
Networks
60
(4), 2012, pp. 245-252
Min-Max quickest path problems
Stefan Ruzika
,
Markus Thiemann
Networks
60
(4), 2012, pp. 253-258
A quadratic semidefinite relaxation approach for resource allocation in orthogonal frequency division multiple access
Pablo Adasme
,
Abdel Lisser
,
Ismael Soto
Networks
59
(1), 2012, pp. 3-12
The complexity of the node capacitated in-tree packing problem
Shinji Imahori
,
Yuichiro Miyamoto
,
Hideki Hashimoto
,
Yusuke Kobayashi
,
Mihiro Sasaki
,
Mutsunori Yagiura
Networks
59
(1), 2012, pp. 13-21
The load-distance balancing problem
Edward Bortnikov
,
Samir Khuller
,
Jian Li
,
Yishay Mansour
,
Joseph Seffi Naor
Networks
59
(1), 2012, pp. 22-29
Seiten 1
2
3
>